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]

Authors

Kristóf Bérczi

This author has not been identified. Look up 'Kristóf Bérczi' in Google

Satoru Fujishige

This author has not been identified. Look up 'Satoru Fujishige' in Google

Naoyuki Kamiyama

This author has not been identified. Look up 'Naoyuki Kamiyama' in Google