A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
From MaRDI portal
Publication:2999337
DOI10.1007/978-3-642-19754-3_11zbMath1325.05164MaRDI QIDQ2999337
Leonardo Lanzi, Andrea Marino, Pierluigi Crescenzi, Roberto Grossi
Publication date: 12 May 2011
Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19754-3_11
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Information theory perspective on network robustness, Computing the eccentricity distribution of large graphs
Uses Software