Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7405958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes |
scientific article; zbMATH DE number 7405958 |
Statements
Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (English)
0 references
4 October 2021
0 references
parameterized algorithms
0 references
treewidth
0 references
edge-deletion
0 references
interval graphs
0 references
