An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578)
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: An exact exponential-time algorithm for the directed maximum leaf spanning tree problem |
scientific article; zbMATH DE number 6082062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact exponential-time algorithm for the directed maximum leaf spanning tree problem |
scientific article; zbMATH DE number 6082062 |
Statements
An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (English)
0 references
13 September 2012
0 references
exact exponential-time algorithms
0 references
NP-hard problems on directed graphs
0 references
outbranching with a maximum number of leaves
0 references
directed maximum leaf spanning tree problem
0 references
0 references
