An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252)
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: An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph |
scientific article; zbMATH DE number 7435236
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph |
scientific article; zbMATH DE number 7435236 |
Statements
An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (English)
0 references
29 November 2021
0 references
domination
0 references
total domination
0 references
semitotal domination
0 references
interval graphs
0 references
polynomial time algorithm
0 references
0 references
