Bounded-Degree Independent Sets in Planar Graphs

Authors:
Therese C. Biedl;Dana F. Wilkinson
Affiliations:
-;-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 5
Cited 1

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Optimal planar point location

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Linear-Time Reconstruction of Delaunay Triangulations with Applications

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms

Induced subgraphs of bounded degree and bounded treewidth

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An independent set in a graph is a set of vertices without edges between them. Every planar graph has an independent set of size at least 1/4n, and there are planar graphs for which no larger independent sets are possible.In this paper, similar bounds are provided for the problem of bounded-degree independent set, i.e. an independent set where additionally all vertices have degree less than a pre-specified bound D. Our upper and lower bounds match (up to a small constant) for D 驴 16.