Tree-width and optimization in bounded degree graphs

被引：0

作者：

Lozin, Vadim ^{[1
]}

Milanic, Martin ^{[2
]}

机构：

[1] Univ Warwick, Inst Math, Coventry CV4 7AL, W Midlands, England

[2] Univ Bielefeld, Technische Fak, D-33501 Bielefeld, Germany

来源：

GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2007年 / 4769卷

关键词：

tree-width; hereditary class of graphs; dominating set; induced matching;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

It is well known that boundedness of tree-width implies polynomial-time solvability of many algorithmic graph problems. The converse statement is generally not true, i.e., polynomial-time solvability does not necessarily imply boundedness of tree-width. However, in graphs of bounded vertex degree, for some problems, the two concepts behave in a more consistent way. In the present paper, we study this phenomenon with respect to three important graph problems - dominating set, independent dominating set and induced matching - and obtain several results toward revealing the equivalency between boundedness of the tree-width and polynomial-time solvability of these problems in bounded degree graphs.

引用

页码：45 / +

页数：3

共 50 条

[41] kappa-channel connectivity in cognitive radio networks for bounded tree-width graphs
Yadav, Ram Narayan
Misra, Rajiv
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (16)
[42] On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
Olyaei, Meysam Rajaati Bavil
Hooshmandasl, Mohammad Reza
Dinneen, Michael J.
Shakiba, Ali
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (02):
[43] A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width
Kawarabayashi, Ken-ichi
Mohar, Bojan
Reed, Bruce
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 771 - +
[44] Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Fernandes, Cristina G.
Lee, Orlando
Wakabayashi, Yoshiko
DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) : 272 - 279
[45] Parity Games on Graphs with Medium Tree-Width
Fearnley, John
Lachish, Oded
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 303 - 314
[46] A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
Angel, Eric
Morais, Sebastien
Regnault, Damien
EURO-PAR 2022: PARALLEL PROCESSING, 2022, 13440 : 136 - 151
[47] On zeros of the characteristic polynomial of matroids of bounded tree-width
Chun, Carolyn
Hall, Rhiannon
Merino, Criel
Noble, Steven
EUROPEAN JOURNAL OF COMBINATORICS, 2017, 60 : 10 - 20
[48] On the tree-depth and tree-width in heterogeneous random graphs
Shang, Yilun
PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 2022, 98 (09) : 78 - 83
[49] Bounded tree-width and CSP-related problems
Faernqvist, Tommy
Jonsson, Peter
ALGORITHMS AND COMPUTATION, 2007, 4835 : 632 - 643
[50] Maximum likelihood bounded tree-width Markov networks
Srebro, N
ARTIFICIAL INTELLIGENCE, 2003, 143 (01) : 123 - 138

← 1 2 3 4 5 →