Paper Info
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.
Year
DOI
Venue
2008
10.1145/1378533.1378541
SPAA
Keywords
Field
DocType
planar graph,graph h,optimal packing,approximation algorithms,distributed algorithms,distributed algorithm
Outerplanar graph,Combinatorics,Line graph,Computer science,Planar straight-line graph,Polyhedral graph,Book embedding,Graph minor,Butterfly graph,Planar graph
Conference
Citations 
PageRank 
References 
6
0.50
12
Authors
3
Name
Order
Citations
PageRank
Andrzej Czygrinow122725.81
Michal Hanćkowiak2816.66
Wojciech Wawrzyniak3978.23