Parameterized complexity of safe set

被引：0
|
作者：
Belmonte, Rémy [1 ]
Hanaka, Tesshu [2 ]
Katsikarelis, Ioannis [3 ]
Lampis, Michael [3 ]
Ono, Hirotaka [4 ]
Otachi, Yota [5 ]
机构：
[1] University of Electro-Communications, Chofu, Tokyo,182-8585, Japan
[2] Chuo University, Bunkyo-ku, Tokyo,112-8551, Japan
[3] Université Paris-Dauphine, PSL University, CNRS, LAMSADE, Paris, France
[4] Nagoya University, Nagoya,464-8601, Japan
[5] Kumamoto University, Kumamoto,860-8555, Japan
来源：
arXiv | 2019年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Parameterization
引用
收藏
相关论文
共 50 条
  • [21] Parameterized extension complexity of independent set and related problems
    Gajarsky, Jakub
    Hlineny, Petr
    Tiwary, Hans Raj
    DISCRETE APPLIED MATHEMATICS, 2018, 248 : 56 - 67
  • [22] Parameterized Complexity Results for 1-safe Petri Nets
    Praveen, M.
    Lodaya, Kamal
    CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 358 - 372
  • [23] The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs
    Misra, Neeldhara
    Rathi, Piyush
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 299 - 310
  • [24] Parameterized Complexity of Independent Set in H-Free Graphs
    Bonnet, Edouard
    Bousquet, Nicolas
    Charbit, Pierre
    Thomasse, Stephan
    Watrigant, Remi
    ALGORITHMICA, 2020, 82 (08) : 2360 - 2394
  • [25] Parameterized Complexity of Independent Set in H-Free Graphs
    Édouard Bonnet
    Nicolas Bousquet
    Pierre Charbit
    Stéphan Thomassé
    Rémi Watrigant
    Algorithmica, 2020, 82 : 2360 - 2394
  • [26] On the parameterized complexity of d-dimensional point set pattern matching
    Cabello, Sergio
    Giannopoulos, Panos
    Knauer, Christian
    PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, 2006, 4169 : 175 - 183
  • [27] Parameterized dominating set problem in chordal graphs: complexity and lower bound
    Liu, Chunmei
    Song, Yinglei
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (01) : 87 - 97
  • [28] Parameterized dominating set problem in chordal graphs: complexity and lower bound
    Chunmei Liu
    Yinglei Song
    Journal of Combinatorial Optimization, 2009, 18 : 87 - 97
  • [29] On the parameterized complexity of SPARSEST CUT and SMALL-SET EXPANSION problems
    Javadi, Ramin
    Nikabadi, Amir
    DISCRETE APPLIED MATHEMATICS, 2024, 355 : 1 - 12
  • [30] On the parameterized complexity of d-dimensional point set pattern matching
    Cabello, Sergio
    Giannopoulos, Panos
    Knauer, Christian
    INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 73 - 77
12345