Paper Info
Title
Total domination and transformation
Abstract
Using a linear time many-one reduction from the problem TOTAL DOMINATING SET to the problem DOMINATING SET we show how to obtain efficient algorithms to compute a minimum cardinality total dominating set on a variety of graph classes, among them permutation graphs, dually chordal graphs and k-polygon graphs. (C) 1997 Elsevier Science B.V.
Year
DOI
Venue
1997
10.1016/S0020-0190(97)00115-4
Inf. Process. Lett.
Keywords
DocType
Volume
total domination,linear time,dominating set,permutation graph,chordal graph
Journal
63
Issue
ISSN
Citations 
3
0020-0190
8
PageRank 
References 
Authors
0.60
5
2
Name
Order
Citations
PageRank
Dieter Kratsch11957146.89
Lorna Stewart236128.05