On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting

被引：0
|
作者：
Firbas, Alexander [1 ]
Sorge, Manuel [1 ]
机构：
[1] TU Wien, Austria
来源：
Leibniz International Proceedings in Informatics, LIPIcs | / 322卷
关键词：
Graphitization - Integrated circuit design - NP-hard - Polynomial approximation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] 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
  • [2] ON THE QUERY COMPLEXITY OF ESTIMATING THE DISTANCE TO HEREDITARY GRAPH PROPERTIES
    Hoppen, Carlos
    Kohayakawa, Yoshiharu
    Lang, Richard
    Lefmann, Hanno
    Stagni, Henrique
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (02) : 1238 - 1251
  • [3] The complexity of cluster vertex splitting and company
    TU Wien, Vienna, Austria
    Discrete Appl Math, 2025, 365 : 190 - 207
  • [4] The Complexity of Cluster Vertex Splitting and Company
    Firbas, Alexander
    Dobler, Alexander
    Holzer, Fabian
    Schafellner, Jakob
    Sorge, Manuel
    Villedieu, Anaïs
    Wißmann, Monika
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14519 LNCS : 226 - 239
  • [5] The Complexity of Cluster Vertex Splitting and Company
    Firbas, Alexander
    Dobler, Alexander
    Holzer, Fabian
    Schafellner, Jakob
    Sorge, Manuel
    Villedieu, Anais
    Wissmann, Monika
    SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 226 - 239
  • [6] Vertex elimination orderings for hereditary graph classes
    Aboulker, Pierre
    Charbit, Pierre
    Trotignon, Nicolas
    Vuskovic, Kristina
    DISCRETE MATHEMATICS, 2015, 338 (05) : 825 - 834
  • [7] On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size
    Sirotkin D.V.
    Malyshev D.S.
    Journal of Applied and Industrial Mathematics, 2018, 12 (4) : 759 - 769
  • [8] A note on the computational complexity of graph vertex partition
    Huang, Yuanqiu
    Chub, Yuming
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (03) : 405 - 409
  • [9] Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
    Baumann, Jakob
    Pfretzschner, Matthias
    Rutter, Ignaz
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 30 - 43
  • [10] Parameterized complexity of vertex splitting to pathwidth at most 1
    Baumann, Jakob
    Pfretzschner, Matthias
    Rutter, Ignaz
    Theoretical Computer Science, 2024, 1021
12345