Maw-Shang
Chang
en
algorithm
graph
connected domination
independent perfect domination problem
cocomparability graphs
problem
integer vertex weights
integers
vertex weights
chapters
time
weighted domination problem
arbitrary integer vertex weights
NP
1995
polynomial time
domination problem
https://doi.org/10.1007/bfb0015415
variants
2022-01-01T19:14
chapter
Weighted domination on cocomparability graphs
domination
https://scigraph.springernature.com/explorer/license/
false
weight
perfect domination problem
It is shown in this paper that the weighted domination problem and its two variants, the weighted connected domination and weighted total domination problems are NP-complete on cocomparability graphs when arbitrary integer vertex weights are allowed and all of them can be solved in polynomial time if vertex weights are integers and less than or equal to a constant c. Besides, an O(¦V¦2) algorithm is given for the weighted independent perfect domination problem of a cocomparability graph G=(V, E).
122-131
total domination problem
1995-01-01
paper
978-3-540-47766-2
Algorithms and Computations
978-3-540-60573-7
Katoh
Naoki
10.1007/bfb0015415
doi
Staples
John
Computation Theory and Mathematics
Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiun, Chiayi, 621, Taiwan, Republic of China
Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiun, Chiayi, 621, Taiwan, Republic of China
pub.1035705709
dimensions_id
Springer Nature - SN SciGraph project
Peter
Eades
Moffat
Alistair
Springer Nature
Information and Computing Sciences