A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897)
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: A simple optimal algorithm for k-tuple dominating problem in interval graphs |
scientific article; zbMATH DE number 7632070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs |
scientific article; zbMATH DE number 7632070 |
Statements
A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (English)
0 references
12 December 2022
0 references
domination
0 references
\(k\)-tuple domination
0 references
total \(k\)-domination
0 references
\(k\)-domination
0 references
linear time algorithm
0 references
interval graph
0 references
0 references
0 references
0 references
0 references
0 references
0.8816472291946411
0 references
0.846603274345398
0 references
0.8286803364753723
0 references
0.8226770758628845
0 references
0.8130242824554443
0 references
