New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102)
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: New algorithms for weighted k-domination and total k-domination problems in proper interval graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs |
scientific article |
Statements
New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (English)
0 references
18 October 2019
0 references
\(k\)-domination
0 references
total \(k\)-domination
0 references
proper interval graph
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9754379987716676
0 references
0.8537170886993408
0 references
0.8161072731018066
0 references
0.8134847283363342
0 references
0.8116465210914612
0 references
