Faster approximation of distances in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4619 LNCS, Issue , 2007, Pages 541-552

  Berman, Piotr ^a   Kasiviswanathan, Shiva Prasad ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; GRAPH THEORY; PROBLEM SOLVING;

BOOLEAN MATRIX MULTIPLICATIONS; DETERMINISTIC ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 38149066832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_47     Document Type: Conference Paper

References (21)

1. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: STOC '07, ACM (to appear)
2. Galil, Z., Margalit, O.: All pairs shortest distances for graphs with small integer length edges. Information and Computation 134(2), 103-139 (1997)
3. Galil, Z., Margalit, O.: AU pairs shortest paths for graphs with small integer length edges. JCSS 54(2), 243-254 (1997)
4. Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. JCSS 51 (1995)
5. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetical progressions. Journal of Symbolic Computation 9, 251-280 (1990)
6. Zwick, U.: Exact and approximate distances in graphs - A survey. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 33-48. Springer, Heidelberg (2001)
7. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing 28(4), 1167-1181 (1999)
8. Cohen, E., Zwick, U.: All-pairs small-stretch paths. Journal of Algorithms 38(2), 335-353 (2001)
9. Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM Journal on Computing 29(5), 1740-1759 (2000)
10. Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: FOCS '06, IEEE, pp. 591-602 (2006)
11. Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms 1(2), 283-323 (2005)
12. Chan, T.M.: All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In: SODA '06, ACM, pp. 514-523 (2006)
13. Boitmanis, K., Freivalds, K., Ledins, P., Opmanis, R.: Fast and simple approximation of the diameter and radius of a graph. In: Àlvarez, C., Sema, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 98-108. Springer, Heidelberg (2006)
14. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications 3(3) (1999)
15. Berman, P., Kasiviswanathan, S.P.: Faster approximation of distances in graphs (2007) Available at http://www.cse.psu.edu/~kasivisw/fadig.pdf
16. Thorup, M., Zwick, U.: Approximate distance oracles. Journal of ACM 52(1), 1-24 (2005)
17. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal of Applied Mathematics 36, 177-189 (1979)
18. Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. JCSS 55(1), 3-23 (1997)
19. Coppersmith, D.: Rectangular matrix multiplication revisited. Journal of Complexity 13(1), 42-49 (1997)
20. Huang, X., Pan, V.Y.: Fast rectangular matrix multiplication and applications. Journal of Complexity 14(2), 257-299 (1998)
21. Cohen, E.: Efficient parallel shortest-paths in digraphs with a separator decomposition. Journal of Algorithms 21(2), 331-357 (1996)