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 the normal view instead:
scientific article; zbMATH DE number 6072546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9094748497009276
0 references
0.7731662392616272
0 references
0.7653073668479919
0 references
0.7529148459434509
0 references
