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 条

[41] UNIVERSALITY FOR AND IN INDUCED-HEREDITARY GRAPH PROPERTIES
Broere, Izak
Heidema, Johannes
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (01) : 33 - 47
[42] GRAPH PROPERTIES FOR SPLITTING WITH GROUNDED LAPLACIAN MATRICES
MIEKKALA, U
BIT, 1993, 33 (03): : 485 - 495
[43] The Complexity of the Vertex 3-Colorability Problem for Some Hereditary Classes Defined By 5-Vertex Forbidden Induced Subgraphs
Malyshev, D. S.
GRAPHS AND COMBINATORICS, 2017, 33 (04) : 1009 - 1022
[44] The Complexity of the Vertex 3-Colorability Problem for Some Hereditary Classes Defined By 5-Vertex Forbidden Induced Subgraphs
D. S. Malyshev
Graphs and Combinatorics, 2017, 33 : 1009 - 1022
[45] Solving phase retrieval via graph projection splitting
Li Ji
Zhao Hongkai
INVERSE PROBLEMS, 2020, 36 (05)
[46] Limiting Properties of Random Graph Models with Vertex and Edge Weights
Sergey Foss
Takis Konstantopoulos
Journal of Statistical Physics, 2018, 173 : 626 - 643
[47] AN ASYMPTOTIC BOUND FOR THE COMPLEXITY OF MONOTONE GRAPH PROPERTIES
Korneffel, Torsten
Triesch, Eberhard
COMBINATORICA, 2010, 30 (06) : 735 - 743
[48] Limiting Properties of Random Graph Models with Vertex and Edge Weights
Foss, Sergey
Konstantopoulos, Takis
JOURNAL OF STATISTICAL PHYSICS, 2018, 173 (3-4) : 626 - 643
[49] GRAPH-THEORETIC PROPERTIES IN COMPUTATIONAL COMPLEXITY
VALIANT, LG
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 278 - 285
[50] An asymptotic bound for the complexity of monotone graph properties
Torsten Korneffel
Eberhard Triesch
Combinatorica, 2010, 30 : 735 - 743

← 1 2 3 4 5 →