Parameterized Complexity of Eulerian Deletion Problems

被引：0

作者：

Cygan, Marek ^{[1
]}

Marx, Daniel ^{[2
]}

Pilipczuk, Marcin ^{[1
]}

Pilipczuk, Michal ^{[1
]}

Schlotter, Ildiko ^{[3
]}

机构：

[1] Univ Warsaw, Inst Informat, PL-00325 Warsaw, Poland

[2] Humboldt Univ, Inst Informat, Berlin, Germany

[3] Budapest Univ Technol & Econ, Dept Comp Sci & Informat Theory, Budapest, Hungary

来源：

GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2011年 / 6986卷

关键词：

EDGE MODIFICATION PROBLEMS; HEREDITARY PROPERTIES; NP-COMPLETENESS; ALGORITHMS; KERNELS; GRAPHS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study a family of problems where the goal is to make a graph Eulerian by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc. Of particular interest is a randomized FPT algorithm for making an undirected graph Eulerian by deleting the minimum number of edges.

引用

页码：131 / +

页数：3

共 50 条

[21] Parameterized complexity of happy coloring problems
Agrawal, Akanksha
Aravind, N. R.
Kalyanasundaram, Subrahmanyam
Kare, Anjeneya Swami
Lauri, Juho
Misra, Neeldhara
Reddy, I. Vinod
THEORETICAL COMPUTER SCIENCE, 2020, 835 : 58 - 81
[22] The parameterized complexity of maximality and minimality problems
Chen, Yijia
Flum, Joerg
PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2006, 4169 : 25 - 37
[23] PARAMETERIZED COMPLEXITY FOR GRAPH LAYOUT PROBLEMS
Serna, Maria
Thilikos, Dimitrios M.
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (86): : 41 - 65
[24] Parameterized complexity of constraint satisfaction problems
Marx, D
19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 139 - 149
[25] Parameterized Complexity of Secluded Connectivity Problems
Fedor V. Fomin
Petr A. Golovach
Nikolay Karpov
Alexander S. Kulikov
Theory of Computing Systems, 2017, 61 : 795 - 819
[26] Incremental Problems in the Parameterized Complexity Setting
Mans, Bernard
Mathieson, Luke
THEORY OF COMPUTING SYSTEMS, 2017, 60 (01) : 3 - 19
[27] Parameterized Complexity of Directed Spanner Problems
Fedor V. Fomin
Petr A. Golovach
William Lochet
Pranabendu Misra
Saket Saurabh
Roohani Sharma
Algorithmica, 2022, 84 : 2292 - 2308
[28] On miniaturized problems in parameterized complexity theory
Chen, YJ
Flum, J
PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2004, 3162 : 108 - 120
[29] Parameterized complexity of constraint satisfaction problems
Marx, D
COMPUTATIONAL COMPLEXITY, 2005, 14 (02) : 153 - 183
[30] On miniaturized problems in parameterized complexity theory
Chen, YJ
Flum, J
THEORETICAL COMPUTER SCIENCE, 2006, 351 (03) : 314 - 336

← 1 2 3 4 5 →