Kernelization and sparseness: The case of dominating set

被引：0
|
作者：
机构：
[1] Drange, Pål Grønås
[2] Dregi, Markus
[3] Fomin, Fedor V.
[4] Kreutzer, Stephan
[5] Lokshtanov, Daniel
[6] Pilipczuk, Marcin
[7] Pilipczuk, Michal
[8] Reidl, Felix
[9] Villaamil, Fernando Sánchez
[10] 1,Saurabh, Saket
[11] Siebertz, Sebastian
[12] Sikdar, Somnath
来源：
| 2016年 / Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing卷 / 47期
关键词：
921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 951 Materials Science;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
27
引用
收藏
相关论文
共 50 条
  • [1] Kernelization and Sparseness: the Case of Dominating Set
    Drange, Pal Gronas
    Dregi, Markus
    Fomin, Fedor V.
    Kreutzer, Stephan
    Lokshtanov, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Reidl, Felix
    Villaamil, Fernando Sanchez
    Saurabh, Saket
    Siebertz, Sebastian
    Sikdar, Somnath
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [2] Maximum matching and kernelization of edge dominating set
    Gao, Hang
    Gao, Wenyu
    INFORMATION PROCESSING LETTERS, 2018, 136 : 21 - 24
  • [3] On Kernelization for Edge Dominating Set under Structural Parameters
    Hols, Eva-Maria C.
    Kratsch, Stefan
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [4] The effect of girth on the kernelization complexity of Connected Dominating Set
    Misra, Neeldhara
    Philip, Geevarghese
    Raman, Venkatesh
    Saurabh, Saket
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 96 - 107
  • [5] Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
    Gu, Qianping
    Imani, Navid
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 26 - 37
  • [6] DOMINATING SET AND CONVERSE DOMINATING SET OF A DIRECTED GRAPH
    FU, Y
    AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (08): : 861 - +
  • [7] An independent dominating set in the complement of a minimum dominating set of a tree
    Henning, Michael A.
    Loewenstein, Christian
    Rautenbach, Dieter
    APPLIED MATHEMATICS LETTERS, 2010, 23 (01) : 79 - 81
  • [8] Partitioning the Vertices of a Graph into a Total Dominating Set and an Independent Dominating Set
    Delgado, Pamela
    Desormeaux, Wyatt J.
    Haynes, Teresa W.
    ARS COMBINATORIA, 2019, 144 : 367 - 379
  • [9] Lossy Kernelization for (Implicit) Hitting Set Problems
    Fomin, Fedor V.
    Le, Tien-Nam
    Lokshtanov, Daniel
    Saurabh, Saket
    Thomassé, Stéphan
    Zehavi, Meirav
    arXiv, 2023,
  • [10] Online Dominating Set
    Joan Boyar
    Stephan J. Eidenbenz
    Lene M. Favrholdt
    Michal Kotrbčík
    Kim S. Larsen
    Algorithmica, 2019, 81 : 1938 - 1964
12345