Title of article
Improved bottleneck domination algorithms Original Research Article
Author/Authors
Ton Kloks، نويسنده , , Dieter Kratsch، نويسنده , , Chuan-Min Lee، نويسنده , , Jiping Liu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
15
From page
1578
To page
1592
Abstract
W.C.K. Yen introduced BOTTLENECK DOMINATION and BOTTLENECK INDEPENDENT DOMINATION. He presented an image-time algorithm to compute a minimum bottleneck dominating set. He also obtained that the BOTTLENECK INDEPENDENT DOMINATING SET problem is NP-complete, even when restricted to planar graphs.
Keywords
Bottleneck domination , Bottleneck independent domination , AT-free graphs , Chordal graphs , Permutation graphs
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886305
Link To Document