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
引用
收藏
相关论文
共 3 条
  • [1] Mixed dominating set: A parameterized perspective
    Jain, Pallavi
    Jayakrishnan, M.
    Panolan, Fahad
    Sahu, Abhishek
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10520 LNCS : 330 - 343
  • [2] New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set
    Sorbonne Universités, UPMC Univ Paris 06, UMR 7606, LIP6, Paris
    75005, France
    不详
    75005, France
    不详
    7243, France
    不详
    不详
    Theory Comput. Syst., 2 (330-346):
  • [3] Distributed local approximation of the minimum k-tuple dominating set in planar graphs
    Czygrinow, Andrzej
    Hanćkowiak, Michal
    Szymańska, Edyta
    Wawrzyniak, Wojciech
    Witkowski, Marcin
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8878 : 49 - 59
1