ACM Symposium on Discrete Algorithms, SODA 2016

Article Details
Title: New Bounds for Approximating Extremal Distances in Undirected Graphs
Article URLs:
Alternative Article URLs:
Authors: Massimo Cairo
  • Scuola Normale Superiore
Roberto Grossi
  • Universit√† di Pisa
Romeo Rizzi
  • Universit√† di Verona
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/CairoGR16
Author Comments:

Discuss this paper and its artifacts below