Distributed Algorithms for Planar Networks I: Planar Embedding

This paper presents the first (non-trivial) distributed planar embedding algorithm. We consider this a crucial first step in a broader program to design efficient distributed algorithms for planar networks. We work in the standard distributed model in which nodes can send an O(log n)-bit message to each of their neighbors per round. In a planar network, with n nodes and diameter D, our deterministic planar embedding algorithm uses O(D dot min{log n, D) rounds to compute a combinatorial planar embedding, which consists of each node knowing the clockwise order of its incident edges in a fixed planar drawing. The complexity of our algorithm is near-optimal and matches the trivial lower bound of Omega(D) up to a log n factor. No algorithm outperforming the trivial round complexity of O(n) was known prior to this work.

[1]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[2]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[3]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[4]  Philip N. Klein,et al.  An efficient parallel algorithm for planarity , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[6]  Philip N. Klein,et al.  An efficient parallel algorithm for planarity , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7]  Takao Nishizeki,et al.  Planar Graphs: Theory and Algorithms , 1988 .

[8]  Shay Kutten,et al.  Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.

[9]  David Peleg,et al.  A near-tight lower bound on the time complexity of distributed MST construction , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[11]  Michael Elkin,et al.  Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem , 2004, STOC '04.

[12]  John M. Boyer,et al.  On the Cutting Edge: Simplified O(n) Planarity by Edge Addition , 2004, J. Graph Algorithms Appl..

[13]  Robert E. Tarjan,et al.  Planarity Algorithms via PQ-Trees (Extended Abstract) , 2008, Electron. Notes Discret. Math..

[14]  R. Tarjan,et al.  Planarity Algorithms via PQ-Trees , 2008 .

[15]  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[16]  Boaz Patt-Shamir,et al.  Fast routing table construction using small messages: extended abstract , 2012, STOC '13.

[17]  Fabian Kuhn,et al.  Distributed Minimum Cut Approximation , 2013, DISC.

[18]  Hsin-Hao Su,et al.  Almost-Tight Distributed Minimum Cut Algorithms , 2014, DISC.

[19]  Boaz Patt-Shamir,et al.  Improved distributed steiner forest construction , 2014, PODC '14.

[20]  Mohsen Ghaffari,et al.  Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set , 2014, ICALP.

[21]  Christoph Lenzen,et al.  Near-Optimal Distributed Tree Embedding , 2014, DISC.

[22]  Fabian Kuhn,et al.  Distributed connectivity decomposition , 2013, PODC.

[23]  Danupon Nanongkai,et al.  Distributed approximation algorithms for weighted shortest paths , 2014, STOC.

[24]  Boaz Patt-Shamir,et al.  Near-Optimal Distributed Maximum Flow: Extended Abstract , 2015, PODC.

[25]  Bernhard Haeupler,et al.  Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut , 2016, SODA.

[26]  Boaz Patt-Shamir,et al.  Near-Optimal Distributed Maximum Flow , 2015, SIAM J. Comput..