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 条
  • [41] A lower bound for testing 3-colorability in bounded-degree graphs
    Bogdanov, A
    Obata, K
    Trevisan, L
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 93 - 102
  • [42] Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs
    Bezakova, Ivona
    Galanis, Andreas
    Goldberg, Leslie Ann
    Stefankovic, Daniel
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (01)
  • [43] On the Number of Connected Sets in Bounded Degree Graphs
    Kangas, Kustaa
    Kaski, Petteri
    Koivisto, Mikko
    Korhonen, Janne H.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 336 - 347
  • [44] Quantum speedup of the traveling-salesman problem for bounded-degree graphs
    Moylett, Dominic J.
    Linden, Noah
    Montanaro, Ashley
    PHYSICAL REVIEW A, 2017, 95 (03)
  • [45] The Planar Hajos Calculus for Bounded Degree Graphs
    Iwama, Kazuo
    Seto, Kazuhisa
    Tamaki, Suguru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (06): : 1000 - 1007
  • [46] Partitioning planar graphs into bounded degree forests
    Wang, Yang
    Wang, Jiali
    Wang, Weifan
    Kong, Jiangxu
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 474
  • [47] On the number of connected sets in bounded degree graphs
    Kangas, Kustaa
    Kaski, Petteri
    Korhonen, Janne H.
    Koivisto, Mikko
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (04):
  • [48] Planar Graphs of Bounded Degree Have Bounded Queue Number
    Bekos, Michael
    Foerster, Henry
    Gronemann, Martin
    Mchedlidze, Tamara
    Montecchiani, Fabrizio
    Raftopoulou, Chrysanthi
    Ueckerdt, Torsten
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 176 - 184
  • [49] PLANAR GRAPHS OF BOUNDED DEGREE HAVE BOUNDED QUEUE NUMBER
    Bekos, Michael A.
    Foerster, Henry
    Gronemann, Martin
    Mchedlidze, Tamara
    Montecchiani, Fabrizio
    Raftopoulou, Chrysanthi
    Ueckerdt, Torsten
    SIAM JOURNAL ON COMPUTING, 2019, 48 (05) : 1487 - 1502
  • [50] The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
    Guruswami, Venkatesan
    Sinop, Ali Kemal
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1615 - 1626
12345