- Conference Paper
Rights / licenseCreative Commons Attribution 3.0 Unported
We present a randomized distributed algorithm that computes a Depth-First Search (DFS) tree in ~O(D) rounds, in any planar network G=(V,E) with diameter D, with high probability. This is the first sublinear-time distributed DFS algorithm, improving on a three decades-old O(n) algorithm of Awerbuch (1985), which remains the best known for general graphs. Furthermore, this ~O(D) round complexity is nearly-optimal as Omega(D) is a trivial lower bound. A key technical ingredient in our results is the development of a distributed method for (recursively) computing a separator path, which is a path whose removal from the graph leaves connected components that are all a constant factor smaller. We believe that the general method we develop for computing path separators recursively might be of broader interest, and may provide the first step towards solving many other problems Show more
Richa, Andrea W.
Book title31st International Symposium on Distributed Computing (DISC 2017)
Journal / seriesLeibniz International Proceedings in Informatics
Pages / Article No.
PublisherSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
SubjectDFS; planar graphs; CONGEST; separator; Computer Science; Computer Science
Organisational unit09587 - Ghaffari, Mohsen / Ghaffari, Mohsen
MoreShow all metadata