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 条
  • [21] Complexity-separating graph classes for vertex, edge and total colouring
    de Figueiredo, Celina M. H.
    DISCRETE APPLIED MATHEMATICS, 2020, 281 : 162 - 171
  • [22] Parallel complexity of partitioning a planar graph into vertex-induced forests
    Chen, ZZ
    He, X
    DISCRETE APPLIED MATHEMATICS, 1996, 69 (1-2) : 183 - 198
  • [23] On the complexity of finding an unknown cut via vertex queries
    Afshani, Peyman
    Chiniforooshan, Ehsan
    Dorrigiv, Reza
    Farzan, Arash
    Mirzazadeh, Mehdi
    Simjour, Narges
    Zarrabi-Zadeh, Hamid
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 459 - +
  • [24] A note on the speed of hereditary graph properties
    Lozin, Vadim V.
    Mayhill, Colin
    Zamaraev, Victor
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [25] Vertex selection via a multi-graph analysis
    Chakareski, Jacob
    SIGNAL PROCESSING, 2014, 102 : 139 - 150
  • [26] An inductive construction for plane Laman graphs via vertex splitting
    Fekete, Z
    Jordán, T
    Whiteley, W
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 299 - 310
  • [27] DECISION TREE COMPLEXITY OF GRAPH PROPERTIES
    Gao Suixiang (Mathematics Department
    中国科学院大学学报, 1999, (02) : 95 - 99
  • [28] Vertex and edge covers with clustering properties: Complexity and algorithms
    Fernau, Henning
    Manlove, David F.
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (02) : 149 - 167
  • [29] On the recognition complexity of some graph properties
    Triesch, E
    COMBINATORICA, 1996, 16 (02) : 259 - 268
  • [30] On the sensitivity complexity of bipartite graph properties
    Gao, Yihan
    Mao, Jieming
    Sun, Xiaoming
    Zuo, Song
    THEORETICAL COMPUTER SCIENCE, 2013, 468 : 83 - 91
12345