Important Separators and Parameterized Algorithms

被引：0
|
作者：
Marx, Daniel [1 ]
机构：
[1] Humboldt Univ, Inst Informat, Berlin, Germany
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2011年 / 6986卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The notion of "important separators" and bounding the number of such separators turned out to be a very useful technique in the design of fixed-parameter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al. [3] on the DIRECTED FEEDBACK VERTEX SET problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.
引用
收藏
页码：5 / 10
页数：6
相关论文
共 50 条
  • [1] Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
    Lokshtanov, Daniel
    Panolan, Fahad
    Saurabh, Saket
    Sharma, Roohani
    Zehavi, Meirav
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2785 - 2800
  • [2] Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
    Lokshtanov, Daniel
    Panolan, Fahad
    Saurabh, Saket
    Sharma, Roohani
    Zehavi, Meirav
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (03)
  • [3] Graph separators: a parameterized view
    Alber, J
    Fernau, H
    Niedermeier, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) : 808 - 832
  • [4] Graph separators: A parameterized view
    Alber, J
    Fernau, H
    Niedermeier, R
    COMPUTING AND COMBINATORICS, 2001, 2108 : 318 - 327
  • [5] Parameterized Algorithms for Boxicity
    Adiga, Abhijin
    Chitnis, Rajesh
    Saurabh, Saket
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 366 - +
  • [6] Subexponential parameterized algorithms
    Dorn, Frederic
    Fomin, Fedor V.
    Thilikos, Dimitrios M.
    COMPUTER SCIENCE REVIEW, 2008, 2 (01) : 29 - 39
  • [7] Subexponential parameterized algorithms
    Dorn, Frederic
    Fomin, Fedor V.
    Thilikos, Dimitrios M.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 15 - +
  • [8] On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
    Heggernes, Pinar
    van't Hof, Pim
    Marx, Daniel
    Misra, Neeldhara
    Villanger, Yngve
    ALGORITHMICA, 2015, 72 (03) : 687 - 713
  • [9] On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
    Pinar Heggernes
    Pim van ’t Hof
    Dániel Marx
    Neeldhara Misra
    Yngve Villanger
    Algorithmica, 2015, 72 : 687 - 713
  • [10] On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
    Heggernes, Pinar
    van 't Hof, Pim
    Marx, Daniel
    Misra, Neeldhara
    Villanger, Yngve
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 332 - 343
12345