Path Discovery in Vehicular Ad Hoc Networks

Dahiya, Alpana; Madhu,; Bansal, Niyati

doi:10.1109/acct.2012.83

Cited by 5 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Traffic Routing: It pertains to a set of routing problems in which the objective is to discover the most efficient route between two points [116]. For example, given a graph where the nodes represent geographical locations, paths are useful to study congestion and security problems [56]. Another example is a graph of broadcast information between computers, where the computers or network devices are the nodes, and the connections between them are the edges.…”

Section: E: Social Networkmentioning

confidence: 99%

Path Querying in Graph Databases: A Systematic Mapping Study

García,

Angles

2024

IEEE Access

View full text Add to dashboard Cite

Path querying refers to the evaluation of path queries in a graph database. New research in this topic is crucial for the development of graph database systems as path queries are associated with relevant use-cases and application domains. The aim of this article is to identify and establish what is currently known about path querying in graph databases. To achieve this, we conducted a systematic mapping study (SMS) in which we explored four digital libraries and collected research papers published from 1970 to 2022. These articles were filtered, classified and analyzed to extract quantitative and qualitative information which is presented in this article. Additionally, we provide a concise description of keywords, use-cases and application domains associated with path querying in graph databases.

show abstract

Section: E: Social Networkmentioning

confidence: 99%