Efficient processing of distance queries in large graphs: A vertex cover approach

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2012, Pages 457-468

  Cheng, James ^a   Ke, Yiping ^b   Chu, Shumo ^a   Cheng, Carter ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b INSTITUTE OF HIGH PERFORMANCE COMPUTING   (Singapore)

Author keywords

disk based shortest path index; distance graph; distance queries; single source shortest paths; vertex cover

Indexed keywords

DISK-BASED; DISTANCE GRAPHS; DISTANCE QUERIES; INDEX CONSTRUCTION; INPUT GRAPHS; LARGE GRAPHS; MAIN MEMORY; REAL-WORLD GRAPHS; ROUTING PLANNING; SHORTEST-PATH; VERTEX COVER;

ALGORITHMS; QUERY PROCESSING;

GRAPH THEORY;

EID: 84862687328     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213836.2213888     Document Type: Conference Paper

References (31)

1. I. Abraham, A. Fiat, A. V. Goldberg, and R. F. F. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In SODA, pages 782-793, 2010.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9):1116-1127, 1988.
3. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput., 28(4):1167-1181, 1999.
4. D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory BFS algorithms. In SODA, pages 601-610, 2006.
5. D. Ajwani, U. Meyer, and V. Osipov. Improved external memory bfs implementation. In ALENEX, 2007.
6. A. L. Buchsbaum, M. H. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In SODA, pages 859-860, 2000.
7. J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu. Finding maximal cliques in massive networks by h*-graph. In SIGMOD Conference, pages 447-458, 2010.
8. T. R. Coffman and S. E. Marcus. Dynamic classification of groups through social network analysis and HMMs. In IEEE Aerospace Conference, pages 3197-3205, 2004.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. TheMIT Press and McGraw-Hill Book Company, 2001.
10. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269U{combining double acute accent}271, 1959.
11. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, 1972.
12. D. Eppstein and J. Wang. Fast approximation of centrality. In SODA, pages 228-229, 2001.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
14. L. Ford and D. R. Fulkerson. Maximum flow through a network. Canadian Journal of Mathematics, 8(3):399-404, 1956.
15. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35U{combining double acute accent}41, 1977.
16. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973.
17. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In In Proc. IEEE Symp. on Parallel and Distributed Processing, pages 169-177, 1996.
18. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In ESA, pages 723-735, 2002.
19. U. Meyer. Via detours to I/O-efficient shortest paths. In Efficient Algorithms, pages 219-232, 2009.
20. U. Meyer and V. Osipov. Design and implementation of a practical i/o-efficient shortest paths algorithm. In ALENEX, pages 85-96, 2009.
21. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths. In ESA, pages 434-445. Springer-Verlag, 2003.
22. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths with unbounded edge lengths. In ESA, pages 540-551, 2006.
23. S. Micali and V. V. Vazirani. An O(|E|√|V|) algoithm for finding maximum matching in general graphs. In FOCS, pages 17-27, 1980.
24. K. Munagala and A. G. Ranade. I/o-complexity of graph algorithms. In SODA, pages 687-694, 1999.
25. M. Najork and J. L. Wiener. Breadth-first crawling yields high-quality pages. In WWW, pages 114-118, 2001.
26. A. Shimbel. Structural parameters of communication networks. Mathematical Biophysics, 15:501U{combining double acute accent}507, 1953.
27. B. E. Thomason, T. R. Coffman, and S. E. Marcus. Sensitivity of social network analysis metrics to observation noise. In IEEE Aerospace Conference, pages 3206-3216, 2004.
28. J. S. Turner. Approximation algorithms for the shortest common superstring problem. Information and Computation, 83(1):1-20, 1989.
29. T. W. Valente and R. K. Foreman. Integration and radiality: Measuring the extent of an individual's connectedness and reachability in a network. Social Networks, 20(1):89-105, 1998.
30. F. Wei. TEDI: efficient shortest path query answering on graphs. In SIGMOD Conference, pages 99-110, 2010.
31. Y. Xiao, W. Wu, J. Pei, W. Wang, and Z. He. Efficiently indexing shortest paths by exploiting symmetry in graphs. In EDBT, pages 493-504, 2009.