FAST ALGORITHMS FOR THE DOMINATING SET PROBLEM ON PERMUTATION GRAPHS

被引：9

作者：

TSAI, KH ^{[1
]}

HSU, WL ^{[1
]}

机构：

[1] ACAD SINICA,INST INFORMAT SCI,TAIPEI 115,TAIWAN

来源：

ALGORITHMICA | 1993年 / 9卷 / 06期

关键词：

DOMINATING SET; PERMUTATION GRAPHS; DYNAMIC PROGRAMMING;

D O I：

10.1007/BF01190158

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

An O(n log log n) (resp. O(n2 log2 n)) algorithm is presented to solve the minimum cardinality (resp. weight) dominating set problem on permutation graphs, assuming the input is a permutation. The best-known previous algorithm was given by Farber and Keil, where they use dynamic programming to get an O(n2) (resp. O(n3)) algorithm. Our improvement is based on the following three factors: (1) an observation on the order among the intermediate terms in the dynamic programming, (2) a new construction formula for the intermediate terms, and (3) efficient data structures for manipulating these terms.

引用

页码：601 / 614

页数：14

共 50 条

[1] FAST ALGORITHMS FOR THE DOMINATING SET PROBLEM ON PERMUTATION GRAPHS
TSAI, KH
HSU, WL
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 109 - 117
[2] THE MINIMUM WEIGHT DOMINATING SET PROBLEM FOR PERMUTATION GRAPHS IS IN NC
RHEE, C
DHALL, SK
LAKSHMIVARAHAN, S
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 28 (02) : 109 - 112
[3] EFFICIENT ALGORITHMS FOR THE MINIMUM WEIGHTED DOMINATING CLIQUE PROBLEM ON PERMUTATION GRAPHS
SRINIVASAN, A
RANGAN, CP
[J]. THEORETICAL COMPUTER SCIENCE, 1991, 91 (01) : 1 - 21
[4] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
Gang Lu
[J]. Journal of Electronic Science and Technology, 2009, 7 (03) : 214 - 222
[5] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
Gang Lu MingTian Zhou Yong Tang MingYuan Zhao XinZheng Niu and Kun She are with School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China
[J]. Journal of Electronic Science and Technology of China., 2009, 7 (03) - 222
[6] Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
Gutner, Shai
[J]. PARAMETERIZED AND EXACT COMPUTATION, 2009, 5917 : 246 - 257
[7] Minimum 2-tuple dominating set of permutation graphs
Barman S.C.
Mondal S.
Pal M.
[J]. Journal of Applied Mathematics and Computing, 2013, 43 (1-2) : 133 - 150
[8] The eternal dominating set problem for interval graphs
Rinemberg, Martin
Soulignac, Francisco J.
[J]. INFORMATION PROCESSING LETTERS, 2019, 146 : 27 - 29
[9] Boundary classes of graphs for the dominating set problem
Alekseev, VE
Korobitsyn, DV
Lozin, VV
[J]. DISCRETE MATHEMATICS, 2004, 285 (1-3) : 1 - 6
[10] Fast algorithms for MIN INDEPENDENT DOMINATING SET
Bourgeois, N.
Della Croce, F.
Escoffier, B.
Paschos, V. Th.
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (4-5) : 558 - 572

← 1 2 3 4 5 →