Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> (Q4554363): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:57, 7 February 2024
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
