Shortest-path queries in static networks
C Sommer - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
We propose a new exact method for shortest-path distance queries on large-scale networks.
Our method precomputes distance labels for vertices by performing a breadth-first search …
Our method precomputes distance labels for vertices by performing a breadth-first search …
Graph query processing using plurality of engines
Zou, LL Chen, MT Özsu, D. Zhao, Answering pattern match queries in large graph
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …
Hierarchical hub labelings for shortest paths
We study hierarchical hub labelings for computing shortest paths. Our new theoretical
insights into the structure of hierarchical labels lead to faster preprocessing algorithms …
insights into the structure of hierarchical labels lead to faster preprocessing algorithms …
Answering billion-scale label-constrained reachability queries within microsecond
In this paper, we study the problem of label-constrained reachability (LCR) query which is
fundamental in many applications with directed edge-label graphs. Although the classical …
fundamental in many applications with directed edge-label graphs. Although the classical …
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling
We propose two dynamic indexing schemes for shortest-path and distance queries on large
time-evolving graphs, which are useful in a wide range of important applications such as …
time-evolving graphs, which are useful in a wide range of important applications such as …
Dlcr: Efficient indexing for label-constrained reachability queries on large dynamic graphs
Many real-world graphs, eg, social networks, biological networks, knowledge graphs,
naturally come with edge-labels, with different labels representing different relationships …
naturally come with edge-labels, with different labels representing different relationships …
Answering reachability and K-reach queries on large graphs with label constraints
The purpose of this paper is to examine the problem of label-constrained reachability (LCR)
and K-reach (LCKR) queries, which are fundamental in a wide variety of applications using …
and K-reach (LCKR) queries, which are fundamental in a wide variety of applications using …
A highway-centric labeling approach for answering distance queries on large sparse graphs
The distance query, which asks the length of the shortest path from a vertex u to another
vertex v, has applications ranging from link analysis, semantic web and other ontology …
vertex v, has applications ranging from link analysis, semantic web and other ontology …
Is-label: an independent-set based labeling scheme for point-to-point distance querying on large graphs
We study the problem of computing shortest path or distance between two query vertices in
a graph, which has numerous important applications. Quite a number of indexes have been …
a graph, which has numerous important applications. Quite a number of indexes have been …