Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844)
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: Better Algorithms and Bounds for Directed Maximum Leaf Problems |
scientific article; zbMATH DE number 5267234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better Algorithms and Bounds for Directed Maximum Leaf Problems |
scientific article; zbMATH DE number 5267234 |
Statements
Better Algorithms and Bounds for Directed Maximum Leaf Problems (English)
0 references
24 April 2008
0 references
0.940444827079773
0 references
0.9092025756835938
0 references
0.903988480567932
0 references
0.8996620774269104
0 references
0.8921342492103577
0 references
