Distributed Algorithms for Planar Networks I
From MaRDI portal
Publication:5361912
DOI10.1145/2933057.2933109zbMath1376.68159OpenAlexW2493557058MaRDI QIDQ5361912
Mohsen Ghaffari, Bernhard Haeupler
Publication date: 29 September 2017
Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2933057.2933109
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distributed algorithms (68W15)
Related Items (5)
Property testing of planarity in the \textsf{CONGEST} model ⋮ Low-congestion shortcuts without embedding ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Compact distributed certification of planar graphs ⋮ Local certification of graphs with bounded genus
This page was built for publication: Distributed Algorithms for Planar Networks I
