Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing
Diameter determination on restricted graph families
Discrete Applied Mathematics
LexBFS-Orderings and Power of Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
All pairs almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Recently considerable effort has been spent on showing that Lexicographic Breadth First Search (LBFS) can be used to determine a tight bound on the diameter of graphs from various restricted classes. In this paper, we show that in some cases, the full power of LBFS is not required and that other variations of Breadth First Search (BFS) suffice. The restricted graph classes that are amenable to this approach all have a small constant upper bound on the maximum sized cycle that may appear as an induced subgraph. We show that on graphs that have no induced cycle of size greater than k, BFS finds an estimate of the diameter that is no worse than diam(G) - 驴k/2驴 - 2.