Finding the Diameter in Real-World Graphs
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 302-313
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast computation of empirically tight bounds for the diameter of massive graphsACM Journal of Experimental Algorithmics, 2009
- Graph Mining: Patterns, Generators and ToolsLecture Notes in Computer Science, 2009
- Network Analysis2005
- The webgraph framework I2004
- External-Memory Breadth-First Search with Sublinear I/O2002
- Diameter determination on restricted graph familiesDiscrete Applied Mathematics, 2001
- Exact and Approximate Distances in Graphs — A Survey2001
- Some large graphs with given degree and diameterJournal of Graph Theory, 1986
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973