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 条

[1] Parameterized Complexity of Eulerian Deletion Problems
Cygan, Marek
Marx, Daniel
Pilipczuk, Marcin
Pilipczuk, Michal
Schlotter, Ildiko
ALGORITHMICA, 2014, 68 (01) : 41 - 61
[2] Parameterized Complexity of Eulerian Deletion Problems
Marek Cygan
Dániel Marx
Marcin Pilipczuk
Michał Pilipczuk
Ildikó Schlotter
Algorithmica, 2014, 68 : 41 - 61
[3] Parameterized complexity of fair deletion problems
Masarik, Tomas
Toufar, Tomas
DISCRETE APPLIED MATHEMATICS, 2020, 278 : 51 - 61
[4] Parameterized Complexity of Fair Deletion Problems
Masarik, Tomas
Toufar, Tomas
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2017), 2017, 10185 : 627 - 641
[5] On the parameterized complexity of s-club cluster deletion problems
Montecchiani, Fabrizio
Ortali, Giacomo
Piselli, Tommaso
Tappini, Alessandra
THEORETICAL COMPUTER SCIENCE, 2023, 969
[6] On the Parameterized Complexity of s-club Cluster Deletion Problems
Montecchiani, Fabrizio
Ortali, Giacomo
Piselli, Tommaso
Tappini, Alessandra
SOFSEM 2023: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2023, 13878 : 159 - 173
[7] Parameterized Eulerian strong component arc deletion problem on tournaments
Crowston, R.
Gutin, G.
Jones, M.
Yeo, A.
INFORMATION PROCESSING LETTERS, 2012, 112 (06) : 249 - 251
[8] The parameterized complexity of counting problems
Flum, J
Grohe, M
FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 538 - 547
[9] Counting Problems in Parameterized Complexity
Zhang, Chihao
Chen, Yijia
TSINGHUA SCIENCE AND TECHNOLOGY, 2014, 19 (04) : 410 - 420
[10] The parameterized complexity of counting problems
Flum, J
Grohe, M
SIAM JOURNAL ON COMPUTING, 2004, 33 (04) : 892 - 922

← 1 2 3 4 5 →