Distributed packing in planar graphs

Andrzej Czygrinow, Michal Hańćkowiak, Wojciech Wawrzyniak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

We give an efficient distributed algorithm that finds an almost optimal packing of a graph H in a planar graph G. The algorithm is deterministic and its running time is poly-logarithmic in the order of G.

Original languageEnglish (US)
Title of host publicationSPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures
Pages55-61
Number of pages7
DOIs
StatePublished - Dec 15 2008
Event20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08 - Munich, Germany
Duration: Jun 14 2008Jun 16 2008

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08
CountryGermany
CityMunich
Period6/14/086/16/08

Keywords

  • Approximation algorithms
  • Distributed algorithms
  • Graph packing

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Distributed packing in planar graphs'. Together they form a unique fingerprint.

  • Cite this

    Czygrinow, A., Hańćkowiak, M., & Wawrzyniak, W. (2008). Distributed packing in planar graphs. In SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures (pp. 55-61). (Annual ACM Symposium on Parallelism in Algorithms and Architectures). https://doi.org/10.1145/1378533.1378541