FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:35, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FPT algorithms and kernels for the directed \(k\)-leaf problem |
scientific article |
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
