Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (Q2905308)
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: Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes |
scientific article; zbMATH DE number 6072546
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes |
scientific article; zbMATH DE number 6072546 |
Statements
27 August 2012
0 references
fixed-parameter tractability
0 references
edge-deletion
0 references
graph modification
0 references
cographs
0 references
trivially perfect graphs
0 references
quasi-threshold graphs
0 references
bounded search tree
0 references
0 references
0 references
Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (English)
0 references
