On complexity of minimum leaf out-branching problem (Q967352)
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: On complexity of minimum leaf out-branching problem |
scientific article; zbMATH DE number 5702617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of minimum leaf out-branching problem |
scientific article; zbMATH DE number 5702617 |
Statements
On complexity of minimum leaf out-branching problem (English)
0 references
28 April 2010
0 references
out-branchings
0 references
leaves
0 references
directed tree-width
0 references
DAG-width
0 references
computational complexity
0 references
minimum leaf out-branching problem
0 references
MinLOB
0 references
0.9274181723594666
0 references
0.9192612767219543
0 references
0.8582108020782471
0 references
0.8339720368385315
0 references
0.8061304688453674
0 references
