Improved sparse covers for graphs excluding a fixed minor

Costas Busch, Ryan Lafortune, Srikanta Tirthapura

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

19 Scopus citations

Abstract

We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the -neighborhood of each node. For planar graphs, the cover has radius no more than 24-8 and degree (maximum cluster overlaps) no more than 18. For every n node graph that excludes a fixed minor, we present an algorithm that yields a cover with radius no more than 4 and degree O(log n). This is a significant improvement over previous results for planar graphs and for graphs excluding a fixed minor; in order to obtain clusters with radius of O(), it was required to have degree polynomial in n. Since sparse covers have many applications in distributed computing, including compact routing, distributed directories and synchronizers, our improved cover construction results in improved algorithms for all these problems, for the class of graphs that exclude a fixed minor.

Original languageEnglish (US)
Title of host publicationPODC'07
Subtitle of host publicationProceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing
Pages61-70
Number of pages10
DOIs
StatePublished - 2007
Externally publishedYes
EventPODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, United States
Duration: Aug 12 2007Aug 15 2007

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferencePODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing
CountryUnited States
CityPortland, OR
Period8/12/078/15/07

Keywords

  • Compact routing
  • Minor free graph
  • Path separator
  • Planar graph
  • Sparse cover

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Improved sparse covers for graphs excluding a fixed minor'. Together they form a unique fingerprint.

Cite this