A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080)
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 linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph |
scientific article; zbMATH DE number 5778929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph |
scientific article; zbMATH DE number 5778929 |
Statements
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (English)
0 references
2 September 2010
0 references
graph algorithms
0 references
directed graph
0 references
arborescence
0 references
packing
0 references
0.7927294373512268
0 references
0.7852437496185303
0 references
0.7779069542884827
0 references
0.7767885327339172
0 references
0.7703419923782349
0 references
