Distributed Almost Exact Approximations for Minor-Closed Families

DOI10.1007/11841036_24zbMath1131.68483OpenAlexW1565291260MaRDI QIDQ5449532

Michał Hanćkowiak, Andrzej Czygrinow

Publication date: 11 March 2008

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

Full work available at URL: https://doi.org/10.1007/11841036_24

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Distributed algorithms (68W15)

Related Items (5)

Distributed minimum dominating set approximations in restricted families of graphs ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Fast Distributed Approximations in Planar Graphs ⋮ Local certification of graphs with bounded genus

This page was built for publication: Distributed Almost Exact Approximations for Minor-Closed Families