Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 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
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
During the winter semester 1996/1997 Kurt Mehlhorn gave a lecture series on algorithms for very large data sets. Towards the end he covered graph traversal problems like finding shortest paths on sparse graphs in external-memory. Kurt concluded the topic stating that there may not be much hope to solve these basic problems I/O-efficiently. The author, just about to finish his master's studies those days, took this as a challenge. The following paper reviews some detours, dead-ends, and happy ends of the author's still ongoing research on external-memory graph traversal.