Paper Info
Title
Near-Optimal Distributed DFS in Planar Graphs.
Abstract
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.
Year
Venue
Field
2017
DISC
Distributed File System,Discrete mathematics,Upper and lower bounds,Depth-first search,Planar,Distributed algorithm,Connected component,Planar graph,Recursion,Mathematics
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Mohsen Ghaffari145244.89
Merav Parter216932.59