A faster algorithm for packing branchings in digraphs (Q494431)
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 faster algorithm for packing branchings in digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for packing branchings in digraphs |
scientific article |
Statements
A faster algorithm for packing branchings in digraphs (English)
0 references
1 September 2015
0 references
packing of branchings
0 references
combinatorial optimization
0 references
0 references
0.8846172094345093
0 references
0.8564311861991882
0 references
0.8523812890052795
0 references
0.8476373553276062
0 references
