Login / Signup
Fast computation of empirically tight bounds for the diameter of massive graphs.
Clémence Magnien
Matthieu Latapy
Michel Habib
Published in:
ACM J. Exp. Algorithmics (2008)
Keyphrases
</>
tight bounds
upper bound
massive graphs
lower bound
databases
optimal solution