Closest 4-leaf power is fixed-parameter tractable (Q1003724)
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: Closest 4-leaf power is fixed-parameter tractable |
scientific article; zbMATH DE number 5523191
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Closest 4-leaf power is fixed-parameter tractable |
scientific article; zbMATH DE number 5523191 |
Statements
Closest 4-leaf power is fixed-parameter tractable (English)
0 references
4 March 2009
0 references
fixed-parameter tractability
0 references
graph algorithm
0 references
graph modification
0 references
graph power
0 references
leaf power
0 references
forbidden subgraph characterization
0 references
