Branching in digraphs with many and few leaves: structural and algorithmic results (Q2315577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7085445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branching in digraphs with many and few leaves: structural and algorithmic results |
scientific article; zbMATH DE number 7085445 |
Statements
Branching in digraphs with many and few leaves: structural and algorithmic results (English)
0 references
25 July 2019
0 references
out-tree
0 references
out-branching
0 references
0.9606812596321106
0 references
0.8742119073867798
0 references
0.8691238760948181
0 references
0.8365132808685303
0 references
0.8163518905639648
0 references
