PERMUTATION GRAPHS - CONNECTED DOMINATION AND STEINER TREES

被引：29

作者：

COLBOURN, CJ ^{[1
]}

STEWART, LK ^{[1
]}

机构：

[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON T6G 2E1,ALBERTA,CANADA

来源：

DISCRETE MATHEMATICS | 1990年 / 86卷 / 1-3期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1016/0012-365X(90)90359-P

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

引用

页码：179 / 189

页数：11

共 50 条

[1] CONNECTED DOMINATION AND STEINER SET ON WEIGHTED PERMUTATION GRAPHS
ARVIND, K
REGAN, CP
[J]. INFORMATION PROCESSING LETTERS, 1992, 41 (04) : 215 - 220
[2] DOUBLY CHORDAL GRAPHS, STEINER TREES, AND CONNECTED DOMINATION
MOSCARINI, M
[J]. NETWORKS, 1993, 23 (01) : 59 - 69
[3] STEINER TREES, CONNECTED DOMINATION AND STRONGLY CHORDAL GRAPHS
WHITE, K
FARBER, M
PULLEYBLANK, W
[J]. NETWORKS, 1985, 15 (01) : 109 - 124
[4] DISTANCE-HEREDITARY GRAPHS, STEINER TREES, AND CONNECTED DOMINATION
DATRI, A
MOSCARINI, M
[J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (03) : 521 - 538
[5] Weighted connected domination and Steiner trees in distance-hereditary graphs
Yeh, HG
Chang, GJ
[J]. DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 245 - 253
[6] STEINER SET AND CONNECTED DOMINATION IN TRAPEZOID GRAPHS
LIANG, YD
[J]. INFORMATION PROCESSING LETTERS, 1995, 56 (02) : 101 - 108
[7] DOMINATION IN PERMUTATION GRAPHS
FARBER, M
KEIL, JM
[J]. JOURNAL OF ALGORITHMS, 1985, 6 (03) : 309 - 321
[8] Power domination on permutation graphs
Wilson, S.
[J]. DISCRETE APPLIED MATHEMATICS, 2019, 262 : 169 - 178
[9] Connected permutation graphs
Koh, Youngmee
Ree, Sangwook
[J]. DISCRETE MATHEMATICS, 2007, 307 (21) : 2628 - 2635
[10] Acyclic domination on bipartite permutation graphs
Xu, Guangjun
Kang, Liying
Shan, Erfang
[J]. INFORMATION PROCESSING LETTERS, 2006, 99 (04) : 139 - 144

← 1 2 3 4 5 →