On the power of BFS to determine a graph's diameter
- 10 September 2003
- Vol. 42 (4), 209-222
- https://doi.org/10.1002/net.10098
Abstract
No abstract availableFunding Information
- Natural Science and Engineering Research Council of Canada
This publication has 11 references indexed in Scilit:
- On linear and circular structure of (claw, net)-free graphsDiscrete Applied Mathematics, 2003
- All pairs almost shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Diameter determination on restricted graph familiesDiscrete Applied Mathematics, 2001
- Almost diameter of a house-hole-free graph in linear time via LexBFSDiscrete Applied Mathematics, 1999
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)SIAM Journal on Computing, 1999
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free GraphsSIAM Journal on Computing, 1999
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962