Total domination in interval graphs revisited (Q1114413)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Total domination in interval graphs revisited |
scientific article; zbMATH DE number 4083000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total domination in interval graphs revisited |
scientific article; zbMATH DE number 4083000 |
Statements
Total domination in interval graphs revisited (English)
0 references
1988
0 references
A previous paper [\textit{J. M. Keil}, ibid. 22, 171-174 (1986; Zbl 0595.05063)] gave an algorithm which claimed to compute a minimum total- dominating set of an interval graph in linear time. This paper presents a family of examples where that algorithm produces the wrong answer. A corrected algorithm is also presented.
0 references
total domination
0 references
interval graph
0 references
algorithm
0 references
0 references
