Login / Signup

On computing the diameter of real-world undirected graphs.

Pilu CrescenziRoberto GrossiMichel HabibLeonardo LanziAndrea Marino
Published in: Theor. Comput. Sci. (2013)
Keyphrases
  • undirected graph
  • real world
  • directed graph
  • directed acyclic graph
  • approximation algorithms
  • data mining
  • spanning tree
  • average degree
  • disjoint paths
  • multicommodity flow
  • graph structure
  • minimum cost
  • positive integer