Kernelization of Two Path Searching Problems on Split Graphs

被引：1

作者：

Yang, Yongjie ^{[1
]}

Shrestha, Yash Raj ^{[2
]}

Li, Wenjun ^{[3
]}

Guo, Jiong ^{[4
]}

机构：

[1] Univ Saarbrucken, Saarbrucken, Germany

[2] ETH, Dept Management Technol & Econ, Zurich, Switzerland

[3] Changsha Univ Sci & Technol, Hunan Prov Key Lab Intelligent Proc Big Data Tran, Sch Comp & Commun Engn, Changsha, Hunan, Peoples R China

[4] Shandong Univ, Sch Comp Sci & Technol, Jinan, Shandong, Peoples R China

来源：

Frontiers in Algorithmics, FAW 2016 | 2016年 / 9711卷

关键词：

DISJOINT PATHS; KERNELS; CYCLES;

D O I：

10.1007/978-3-319-39817-4_23

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In the k-Vertex-Disjoint Paths problem, we are given a graph G and k terminal pairs of vertices, and are asked whether there is a set of k vertex-disjoint paths linking these terminal pairs, respectively. In the k-Path problem, we are given a graph and are asked whether there is a path of length k. It is known that both problems are NP-hard even in split graphs, which are the graphs whose vertices can be partitioned into a clique and an independent set. We study kernelization for the two problems in split graphs. In particular, we derive a 4k vertex-kernel for the k-Vertex-Disjoint Paths problem and a 3/2k(2) + 1/2k vertex-kernel for the k-Path problem.

引用

页码：238 / 249

页数：12

共 50 条

[31] Kernelization of the 3-path vertex cover problem
Brause, Christoph
Schiermeyer, Ingo
[J]. DISCRETE MATHEMATICS, 2016, 339 (07) : 1935 - 1939
[32] Two completely independent spanning trees of split graphs*
Chen, Xiaodong
Liu, Qinghai
Yang, Xiwu
[J]. DISCRETE APPLIED MATHEMATICS, 2023, 340 : 76 - 78
[33] Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve
[J]. IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 164 - 175
[34] Cardinality constrained Path Covering Problems in grid graphs
Apollonio, N
Caccetta, L
Simeone, B
[J]. NETWORKS, 2004, 44 (02) : 120 - 131
[35] The path partition problem and related problems in bipartite graphs
Monnot, Jerome
Toulouse, Sophie
[J]. OPERATIONS RESEARCH LETTERS, 2007, 35 (05) : 677 - 684
[36] Path matrices and spectra of two composite graphs
Lu, Pengli
Luan, Rui
Guo, Yuhong
Chen, Yahong
[J]. Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2022, 43 (02): : 262 - 267
[37] Path coloring problems in graphs are non-approximable
Nomikos, C
[J]. ADVANCES IN INFORMATICS, 2000, : 223 - 230
[38] OPTIMAL PARALLEL ALGORITHMS FOR PATH PROBLEMS ON PLANAR GRAPHS
SRIKRISHNA, G
RANGAN, CP
[J]. THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 27 - 43
[39] On the complexity of path problems in properly colored directed graphs
Granata, Donatella
Behdani, Behnam
Pardalos, Panos M.
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (04) : 459 - 467
[40] KERNELIZATION OF GRAPH HAMILTONICITY: PROPER H-GRAPHS
Chaplick, Steven
Fomin, Fedor, V
Golovach, Petr A.
Knop, Dusan
Zeman, Peter
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (02) : 840 - 892

← 1 2 3 4 5 →