Distributed packing in planar graphs

Andrzej Czygrinow; Michal Hańćkowiak; Wojciech Wawrzyniak

doi:10.1145/1378533.1378541

Distributed packing in planar graphs

Andrzej Czygrinow, Michal Hańćkowiak, Wojciech Wawrzyniak

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 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 language	English (US)
Title of host publication	SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures
Pages	55-61
Number of pages	7
DOIs	https://doi.org/10.1145/1378533.1378541
State	Published - 2008
Event	20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08 - Munich, Germany Duration: Jun 14 2008 → Jun 16 2008

Publication series

Name	Annual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference	20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08
Country/Territory	Germany
City	Munich
Period	6/14/08 → 6/16/08

Keywords

Approximation algorithms
Distributed algorithms
Graph packing

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1145/1378533.1378541

Cite this

Distributed packing in planar graphs. / Czygrinow, Andrzej; Hańćkowiak, Michal; Wawrzyniak, Wojciech.
SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures. 2008. p. 55-61 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 55-61, 20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08, Munich, Germany, 6/14/08. https://doi.org/10.1145/1378533.1378541

@inproceedings{3988c26f00d14c5b864bac42182aa1e6,

title = "Distributed packing in planar graphs",

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.",

keywords = "Approximation algorithms, Distributed algorithms, Graph packing",

author = "Andrzej Czygrinow and Michal Ha{\'n}{\'c}kowiak and Wojciech Wawrzyniak",

year = "2008",

doi = "10.1145/1378533.1378541",

language = "English (US)",

isbn = "9781595939739",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

pages = "55--61",

booktitle = "SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures",

note = "20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08 ; Conference date: 14-06-2008 Through 16-06-2008",

}

TY - GEN

T1 - Distributed packing in planar graphs

AU - Czygrinow, Andrzej

AU - Hańćkowiak, Michal

AU - Wawrzyniak, Wojciech

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - Distributed algorithms

KW - Graph packing

UR - http://www.scopus.com/inward/record.url?scp=57349178976&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57349178976&partnerID=8YFLogxK

U2 - 10.1145/1378533.1378541

DO - 10.1145/1378533.1378541

M3 - Conference contribution

AN - SCOPUS:57349178976

SN - 9781595939739

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 55

EP - 61

BT - SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures

T2 - 20th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'08

Y2 - 14 June 2008 through 16 June 2008

ER -

Distributed packing in planar graphs

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this