The input/output complexity of sorting and related problems
Communications of the ACM
Approximation algorithms for the shortest common superstring problem
Information and Computation
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Breadth-first crawling yields high-quality pages
Proceedings of the 10th international conference on World Wide Web
Introduction to algorithms
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
I/O-efficient undirected shortest paths with unbounded edge lengths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Via Detours to I/O-Efficient Shortest Paths
Efficient Algorithms
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Finding maximal cliques in massive networks by H*-graph
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
K-reach: who is in your small world
Proceedings of the VLDB Endowment
Finding the optimal path over multi-cost graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient single-source shortest path and distance queries on large graphs
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We propose a novel disk-based index for processing single-source shortest path or distance queries. The index is useful in a wide range of important applications (e.g., network analysis, routing planning, etc.). Our index is a tree-structured index constructed based on the concept of vertex cover. We propose an I/O-efficient algorithm to construct the index when the input graph is too large to fit in main memory. We give detailed analysis of I/O and CPU complexity for both index construction and query processing, and verify the efficiency of our index for query processing in massive real-world graphs.