A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

DOI10.1016/J.IC.2015.12.004zbMATH Open1336.68280arXiv1507.03376OpenAlexW2221641379MaRDI QIDQ259059FDOQ259059

A. Zemmari, John Michael Robson, Yves Métivier

Publication date: 10 March 2016

Published in: Information and Computation (Search for Journal in Brave)

Abstract: We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each round each vertex can transmit a different message of size $O(1)$ to each of its neighbours. This paper proposes and analyses a distributed enumeration algorithm of vertices of a graph having a distinguished vertex which satisfies that two vertices with consecutive numbers are at distance at most $3$. We prove that its time complexity is $O(n)$ where $n$ is the number of vertices of the graph. Furthermore, the size of each message is $O(1)$ thus its bit complexity is also $O(n).$ We provide some links between this enumeration and Hamiltonian graphs from which we deduce that this enumeration is optimal in the sense that there does not exist an enumeration which satisfies that two vertices with consecutive numbers are at distance at most $2$. We deduce from this enumeration algorithms which compute all pairs shortest paths and the diameter with a time complexity and a bit complexity equal to $O(n)$. This improves the best known distributed algorithms (under the same hypotheses) for computing all pairs shortest paths or the diameter presented in cite{PRT12,HW12} having a time complexity equal to $O(n)$ and which use messages of size $O(logn)$ bits.

Full work available at URL: https://arxiv.org/abs/1507.03376

Recommendations

• Optimal distributed all pairs shortest paths and applications
• scientific article; zbMATH DE number 1304097
• Distributed exact shortest paths in sublinear time
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• A distributed algorithm for constructing a minimum diameter spanning tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Introduction to Distributed Algorithms
• The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
• Distributed Minimum Cut Approximation
• Optimal distributed all pairs shortest paths and applications
• Trading Bit, Message, and Time Complexity of Distributed Algorithms
• Hamiltonian Paths in the Square of a Tree
• Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components
• Distributed Algorithms for Network Diameter and Girth
• Fast computation of small cuts via cycle space sampling
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• Bit complexity of breaking and achieving symmetry in chains and rings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed Computing: A Locality-Sensitive Approach
• Distributed Verification and Hardness of Distributed Approximation
• All-Pairs Almost Shortest Paths
• Distributed approximation algorithms for weighted shortest paths
• Title not available (Why is that?)
• Minimum Weight Cycles and Triangles: Equivalences and Algorithms
• Fast routing table construction using small messages
• The cube of every connected graph is 1-hamiltonian
• On an Algorithm for Ordering of Graphs
• Trees with Hamiltonian square
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing almost shortest paths

Cited In (3)

• Title not available (Why is that?)
• Small-\(m\) method for detecting all longest paths
• On the Microscopic View of Time and Messages

This page was built for publication: A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259059)