Estimating all pairs shortest paths in restricted graph families: A unified approach

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

Volumn 2204, Issue , 2001, Pages 103-116

  Dragan, Feodor F ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALL PAIRS SHORTEST PATHS; DISTANCE-HEREDITARY GRAPHS; GRAPH CLASS; INDUCED CYCLE; SHORTEST PATH; SHORTEST PATH PROBLEM; UNIFIED APPROACH; WEAKLY CHORDAL GRAPH;

GRAPH THEORY;

EID: 84945283144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_11     Document Type: Conference Paper

References (33)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplications), SIAM J. on Computing, 28 (1999) 1167-1181.
2. N. Alon, Z. Galil, and O. Margalit, On the exponent of the all pairs shortest path problem, Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, 569-575.
3. M. J. Atallah, D. Z. Chen, and D. T. Lee, An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications, Proceedings of the European Symposium on Algorithms, Lecture Notes in Computer Science, 726 (1993) 13-24.
4. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, Near-linear cost sequential and distributed constructions of sparse neighborhood covers, Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, 638-647.
5. V. Balachandhran, and C. Pandu Rangan, All-pairs-shortest length on strongly chordal graphs, Discrete Applied Math., 69 (1996) 169-182.
6. J. Bäsch, S. Khanna, and R. Motwani, On diameter verification and Boolean matrix multiplication, Technical Report STAN-CS-95-1544, Department of Computer Scince, Stanford University, 1995.
7. A. Brandstädt, V. D. Chepoi, and F. F. Dragan, The algorithmic use of hy-pertree structure and maximum neighborhood orderings, Discrete Applied Math., 82 (1998) 43-77.
8. A. Brandstädt, V. D. Chepoi, and F. F. Dragan, Distance approximating trees for chordal and dually chordal graphs, Journal on Algorithms, 30 (1999) 166-184.
9. A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph classes: A survey, SIAM monographs on discrete mathematics and applications, 1999.
10. L. Chen, Solving the shortest-paths problem on bipartite permutation graphs efficiently, Information Processing Letters, 55 (1995) 259-264.
11. V. D. Chepoi, and F. F. Dragan, A note on distance approximating trees in graphs, Europ. J. Combinatorics, 21 (2000) 761-766.
12. E. Cohen, Fast algoruthms for constructing t-spanners and paths with stretch t (extended abstract), Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, 648-658.
13. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression, Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, 1-6.
14. E. Dahlhaus, Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes, Proceedings of the International Workshop "Graph-Theoretic Concepts in Computer Science", Lecture Notes in Computer Science, 657 (1992) 60-69.
15. D. Dor, S. Halperin, and U. Zwick, All pairs almost shortest paths, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, 452-461.
16. F. F. Dragan, Almost diameter of a hose-hole free graph in linear time via LexBFS, Discrete Applied Math., 95 (1999) 223-239.
17. F.F. Dragan, F. Nicolai and A. Brandstadt, LexBFS-orderings and powers of graphs, Proceedings of the International Workshop "Graph-Theoretic Concepts in Computer Science", Lecture Notes in Computer Science, 1197 (1997) 166-180.
18. H. Everett and D.G. Corneil, Recognizing visibility graphs of spiral polygons, Journal on Algorithms, 11 (1990) 1-26.
19. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
20. K. Han, Chandra N. Sekharan and R. Sridhar, Unified all-pairs shortest path algorithms in the chordal hierarchy, Discrete Applied Math., 77 (1997) 59-71.
21. Chin-Wen Ho and Jou-Ming Chang, Solving the all-pairs-shortest-length problem on chordal bipartite graphs, Information Processing Letters, 69 (1999) 87-93.
22. B. Jamison and S. Olariu, On the semi-perfect elimination, Advances in Applied Math., 9 (1988) 364-376.
23. A. Lubiw, Doubly lexical orderings of matrices, SIAM J. on Computing, 16 (1987) 854-879.
24. 2) algorithm for the all-pairs shortest path problem on an interval graph, Networks, 27 (1996) 215-217.
25. R. Motwani, A. Ragunathan and H. Saran, Perfect graphs and ortogonally convex covers, SIAM J. Discrete Math., 2 (1989) 371-392.
26. R. Motwani, A. Ragunathan and H. Saran, Covering orthogonal polygons with star polygons: the perfect graphs approach, J. of Computer and System Sciences, 40 (1990) 19-48.
27. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. on Computing, 16 (1987) 973-989.
28. R. Ravi, M. V. Marathe, and C. Pandu Rangan, An optimal algorithm to solve the all-pair shortest path problem on interval graphs, Networks, 22 (1992) 21-35.
29. R. Seidel, On the all-pair-shortest-path problem, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, 745-749.
30. J.P. Spinrad, Doubly lexical ordering of dense 0-1- matrices, Information Processing Letters, 45 (1993) 229-235.
31. D. Rose, R.E. Tarjan and G. Lueker, Algorithmic aspects on vertex elimination on graphs, SIAM J. on Computing, 5 (1976) 266-283.
32. R. Sridhar, K. Han, and N. Chandrasekharan, Efficient algorithms for shortest distance queries on special classes of polygons, Theoretical Computer Science, 140 (1995) 291-300.
33. R. Sridhar, D. Joshi, and N. Chandrasekharan, Efficient algorithms for shortest distance queries on interval, directed path and circular arc graphs, Proceedings of the 5th International Conference on Computing and Information, 1993, 31-35.