Bounded-degree independent sets in planar graphs

被引：2
|
作者：
Biedl, T [1 ]
Wilkinson, DF [1 ]
机构：
[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
THEORY OF COMPUTING SYSTEMS | 2005年 / 38卷 / 03期
关键词：
D O I：
10.1007/s00224-005-1139-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An independent set of 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 any independent set has size at most 1/4n. 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.
引用
收藏
页码：253 / 278
页数：26
相关论文
共 50 条
  • [1] Bounded-degree independent sets in planar graphs
    Biedl, T
    Wilkinson, DF
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 416 - 427
  • [2] Bounded-Degree Independent Sets in Planar Graphs
    Therese Biedl
    Dana F. Wilkinson
    Theory of Computing Systems, 2005, 38 : 253 - 278
  • [3] Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
    Dujmovic, Vida
    Joret, Gwenael
    Micek, Piotr
    Morin, Pat
    Wood, David R.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (02):
  • [4] Independent sets in bounded-degree hypergraphs
    Halldorsson, Magnus M.
    Losievskaja, Elena
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) : 1773 - 1786
  • [5] Independent sets in bounded-degree hypergraphs
    Halldorsson, Magnus M.
    Losievskaja, Elena
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 263 - +
  • [6] Greed is good: Approximating independent sets in sparse and bounded-degree graphs
    M. M. Halldórsson
    J. Radhakrishnan
    Algorithmica, 1997, 18 : 145 - 163
  • [7] Greed is good: Approximating independent sets in sparse and bounded-degree graphs
    Halldorsson, MM
    Radhakrishnan, J
    ALGORITHMICA, 1997, 18 (01) : 145 - 163
  • [8] Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs
    Halldorsson, M.M.
    Radhakrishnan, J.
    Algorithmica (New York), 1997, 18 (01): : 145 - 163
  • [9] APPROXIMATELY COUNTING INDEPENDENT SETS OF A GIVEN SIZE IN BOUNDED-DEGREE GRAPHS
    Davies, Ewan
    Perkins, Will
    SIAM JOURNAL ON COMPUTING, 2023, 52 (02) : 618 - 640
  • [10] Small Universal Graphs for Bounded-Degree Planar Graphs
    Michael Capalbo
    Combinatorica, 2002, 22 : 345 - 359
12345