✦ LIBER ✦
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
✍ Scribed by Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama
- Book ID
- 108154667
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 185 KB
- Volume
- 109
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.