A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama. A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. Inf. Process. Lett., 109(23-24):1227-1231, 2009. [doi]

Abstract

Abstract is missing.