Critical hereditary graph classes: a survey

被引：0
|
作者：
D. S. Malyshev
P. M. Pardalos
机构：
[1] National Research University Higher School of Economics,
[2] University of Florida,undefined
来源：
Optimization Letters | 2016年 / 10卷
关键词：
Computational complexity; Polynomial-time algorithm ; Hereditary graph class; Independent set problem; Dominating set problem; Coloring problem; List edge-ranking problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The task of complete complexity dichotomy is to clearly distinguish between easy and hard cases of a given problem on a family of subproblems. We consider this task for some optimization problems restricted to certain classes of graphs closed under deletion of vertices. A concept in the solution process is based on revealing the so-called “critical” graph classes, which play an important role in the complexity analysis for the family. Recent progress in studying such classes is presented in the article.
引用
收藏
页码：1593 / 1612
页数：19
相关论文
共 50 条
  • [1] Critical hereditary graph classes: a survey
    Malyshev, D. S.
    Pardalos, P. M.
    OPTIMIZATION LETTERS, 2016, 10 (08) : 1593 - 1612
  • [2] Recoloring some hereditary graph classes
    Belavadi, Manoj
    Cameron, Kathie
    DISCRETE APPLIED MATHEMATICS, 2025, 361 : 389 - 401
  • [3] Towards an Isomorphism Dichotomy for Hereditary Graph Classes
    Schweitzer, Pascal
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 689 - 702
  • [4] Towards an Isomorphism Dichotomy for Hereditary Graph Classes
    Pascal Schweitzer
    Theory of Computing Systems, 2017, 61 : 1084 - 1127
  • [5] Clique-width for hereditary graph classes
    Dabrowski, Konrad K.
    Johnson, Matthew
    Paulusma, Daniel
    SURVEYS IN COMBINATORICS 2019, 2019, 456 : 1 - 56
  • [6] Vertex elimination orderings for hereditary graph classes
    Aboulker, Pierre
    Charbit, Pierre
    Trotignon, Nicolas
    Vuskovic, Kristina
    DISCRETE MATHEMATICS, 2015, 338 (05) : 825 - 834
  • [7] Towards an Isomorphism Dichotomy for Hereditary Graph Classes
    Schweitzer, Pascal
    THEORY OF COMPUTING SYSTEMS, 2017, 61 (04) : 1084 - 1127
  • [8] Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
    Eppstein, David
    Gupta, Siddharth
    Havvaei, Elham
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 217 - 229
  • [9] Steiner trees for hereditary graph classes: A treewidth perspective
    Bodlaender, Hans L.
    Brettell, Nick
    Johnson, Matthew
    Paesani, Giacomo
    Paulusma, Daniel
    van Leeuwen, Erik Jan
    THEORETICAL COMPUTER SCIENCE, 2021, 867 : 30 - 39
  • [10] Stability of Hereditary Graph Classes Under Closure Operations
    Miller, Mirka
    Ryan, Joe
    Ryjacek, Zdenek
    Teska, Jakub
    Vrana, Petr
    JOURNAL OF GRAPH THEORY, 2013, 74 (01) : 67 - 80
12345