FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265)
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: FPT algorithms and kernels for the directed k-leaf problem |
scientific article; zbMATH DE number 5669217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FPT algorithms and kernels for the directed \(k\)-leaf problem |
scientific article; zbMATH DE number 5669217 |
Statements
FPT algorithms and kernels for the directed \(k\)-leaf problem (English)
0 references
12 February 2010
0 references
out-branching subgraph
0 references
digraph
0 references
leaves
0 references
fixed-parameter tractable
0 references
kernel
0 references
directed max leaf problem
0 references
rooted directed k-leaf problem
0 references
0.91395855
0 references
0 references
0.8940469
0 references
0.87869513
0 references
0.87832147
0 references
0.87104297
0 references
0.8657902
0 references
