Abstract
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximation ratio in both cases approaches one with n tending to infinity and the number of synchronous communication rounds is poly-logarithmic in n. Our algorithms are purely deterministic. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Czygrinow, A., Hańćkowiak, M., & Szymańska, E. (2006). Distributed approximation algorithms for planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3998 LNCS, pp. 296–307). Springer Verlag. https://doi.org/10.1007/11758471_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
