Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp> (Q4554363): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3186896 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3000706835 / rank | |||
Normal rank | |||
Latest revision as of 23:40, 19 March 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
