Distributed Approximation Algorithms for Planar Graphs

DOI10.1007/11758471_29zbMath1183.68414OpenAlexW1521888058MaRDI QIDQ3434565

Edyta Szymańska, Andrzej Czygrinow, Michał Hanćkowiak

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758471_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (4)

Compact distributed certification of planar graphs ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Fast Distributed Approximations in Planar Graphs

This page was built for publication: Distributed Approximation Algorithms for Planar Graphs