On the Power of BFS to Determine a Graph's Diameter

Networks

Volumn 42, Issue 4, 2003, Pages 209-222

  Corneil, Derek G ^a   Dragan, Feodor F ^b   Köhler, Ekkehard ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b KENT STATE UNIVERSITY   (United States)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

AT free graphs; Breadth first search; Graph's diameter approximation; K chordal graphs; Linear time algorithm

Indexed keywords

AT-FREE GRAPHS; BREADTH FIRST SEARCH; GRAPH DIAMETER; K-CHORDAL GRAPH;

ALGORITHMS; MATRIX ALGEBRA; NUMERICAL METHODS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

GRAPH THEORY;

EID: 2142721011     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10098     Document Type: Article

References (16)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), SIAM J Comput 28 (1999), 1167-1181.
2. A. Brandstädt and F.F. Dragan, On linear and circular structure of a (claw, net)-free graph, Discr Appl Math, to appear.
3. V.D. Chepoi and F.F. Dragan, Linear-time algorithm for finding a central vertex of a chordal graph, "Algorithms - ESA'94" Second Ann European Symp, Utrecht, The Netherlands, September 1994, Jan van Leeuwen (Editor), LNCS 855, Springer, Berlin, 1994, pp. 159-170.
4. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression, Proc 19th ACM Symp on Theory of Computing, 1987, pp. 1-6.
5. D.G. Corneil, F.F. Dragan, M. Habib, and C. Paul, Diameter determination on restricted graph families, Discr Appl Math 113 (2001), 143-166.
6. D.G. Corneil, S. Olariu, and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J Comput 28 (1999), 1284-1297.
7. D. Dor, S. Halperin, and U. Zwick, All pairs almost shortest paths, Proc 37th Ann IEEE Symp on Foundations of Computer Science, 1996, pp. 452-461.
8. F.F. Dragan, Almost diameter of a house-hole-free graph in linear time via LexBFS, Discr Appl Math 95 (1999), 223-239.
9. F.F. Dragan, F. Nicolai, and A. Brandstädt, LexBFS-orderings and powers of graphs, Proc 22nd Int Workshop "Graph-Theoretic Concepts in Computer Science" (WG'96), Cadenabbia, Italy, 1996, Fabrizio d'Amore, Paolo G. Franciosa, and Alberto Marchetti-Spaccamela (Editors), LNCS 1197, Springer, Berlin, 1997, pp. 166-180.
10. G. Handler, Minimax location of a facility in an undirected tree graph, Trans Sci 7 (1973), 287-293.
11. C.G. Lekkerkerker and J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fundam Math 51 (1962), 45-64.
12. V. Raghavan and J. Spinrad, Robust algorithms for restricted domains, Proc 12th ACM-SIAM Symp on Discrete Algorithms, 2001, pp. 460-467.
13. D. Rose, R.E. Tarjan, and G. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J Comput 5 (1976), 266-283.
14. R. Seidel, On the all-pair-shortest-path problem, Proc 24th ACM Symp Theory of Computing, 1992, pp. 745-749.
15. J.P. Spinrad, Efficient graph representations, Fields Institute Monographs #19, AMS, Providence, 2003.
16. Uri Zwick, Exact and approximate distances in graphs - A survey, "Algorithms - ESA'01" 9th Ann European Symp, Aarhus, Denmark, August 2001, LNCS 2161, Springer, Berlin, 2001, pp. 33-48.