A new algorithm for finding trees with many leaves (Q652536)
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: A new algorithm for finding trees with many leaves |
scientific article; zbMATH DE number 5988474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for finding trees with many leaves |
scientific article; zbMATH DE number 5988474 |
Statements
A new algorithm for finding trees with many leaves (English)
0 references
14 December 2011
0 references
graph algorithms
0 references
out-trees
0 references
out-branchings
0 references
directed maximum-leaf out-tree
0 references
directed maximum-leaf out-branching
0 references
0 references
0 references
0.980217218399048
0 references
0.8836695551872253
0 references
0.8735347986221313
0 references
0.870515763759613
0 references
0.8648777008056641
0 references
