Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> (Q4554363)
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: Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> |
scientific article; zbMATH DE number 6979225
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> |
scientific article; zbMATH DE number 6979225 |
Statements
Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> (English)
0 references
13 November 2018
0 references
subexponential algorithms
0 references
completion problems
0 references
graph modification problems
0 references
interval graphs
0 references
