Fast and Simple Approximation of the Diameter and Radius of a Graph
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 98-108
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the power of BFS to determine a graph's diameterNetworks, 2003
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problemDiscrete Applied Mathematics, 2000
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)SIAM Journal on Computing, 1999
- LexBFS-orderings and powers of graphs1997
- The algorithmic use of hypertree structure and maximum neighbourhood orderings1995
- Dominating cliques in distance-hereditary graphs1994
- A simple linear-time algorithm for computing the center of an interval graphInternational Journal of Computer Mathematics, 1990
- Matrix multiplication via arithmetic progressions1987
- Computation of the center and diameter of outerplanar graphsDiscrete Applied Mathematics, 1980
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973