z-logo
open-access-imgOpen Access
Finding Multidimensional Constraint Reachable Paths for Attributed Graphs
Author(s) -
B. Bhargavi,
K. Swarupa Rani,
Arunjyoti Neog
Publication year - 2022
Publication title -
icst transactions on scalable information systems
Language(s) - Uncategorized
Resource type - Journals
ISSN - 2032-9407
DOI - 10.4108/eetsis.v9i4.2581
Subject(s) - reachability , computer science , scalability , hash function , heuristic , vertex (graph theory) , theoretical computer science , cluster analysis , graph , constraint (computer aided design) , path (computing) , enhanced data rates for gsm evolution , algorithm , mathematics , artificial intelligence , geometry , computer security , database , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom