Distributed Algorithms for Network Diameter and Girth

DOI10.1007/978-3-642-31585-5_58zbMath1343.68283OpenAlexW147275194MaRDI QIDQ3167054

Elad Tal, Liam Roditty, David Peleg

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_58

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (14)

Distributed finite-time calculation of node eccentricities, graph radius and graph diameter ⋮ Distributed distance computation and routing with small messages ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Algebraic methods in the congested clique ⋮ Distributed construction of purely additive spanners ⋮ Unnamed Item ⋮ Approximate proof-labeling schemes ⋮ Efficient and Decentralized Polling Protocol for General Social Networks ⋮ Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems ⋮ Fast approximate shortest paths in the congested clique ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time ⋮ Performance and robustness of discrete and finite time average consensus algorithms ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

This page was built for publication: Distributed Algorithms for Network Diameter and Girth