The \(k\)-neighbourhood-covering problem on interval graphs (Q5747730)
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: The k-neighbourhood-covering problem on interval graphs |
scientific article; zbMATH DE number 5785416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(k\)-neighbourhood-covering problem on interval graphs |
scientific article; zbMATH DE number 5785416 |
Statements
The<i>k</i>-neighbourhood-covering problem on interval graphs (English)
0 references
14 September 2010
0 references
design of algorithms
0 references
analysis of algorithms
0 references
\(k\)-neighbourhood-covering
0 references
interval tree
0 references
interval graph
0 references
0.9149457216262816
0 references
0.8872655630111694
0 references
0.8523155450820923
0 references
0.8466172814369202
0 references
0.8010881543159485
0 references
