On the Power of BFS to Determine a Graphs Diameter
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
On end-vertices of Lexicographic Breadth First Searches
Discrete Applied Mathematics
Finding the diameter in real-world graphs experimentally turning a lower bound into an upper bound
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
I/O-efficient hierarchical diameter approximation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On computing the diameter of real-world undirected graphs
Theoretical Computer Science
| Hi-index | 0.05 |