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]
@article{BercziFK09,
title = {A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph},
author = {Kristóf Bérczi and Satoru Fujishige and Naoyuki Kamiyama},
year = {2009},
doi = {10.1016/j.ipl.2009.09.004},
url = {http://dx.doi.org/10.1016/j.ipl.2009.09.004},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BercziFK09},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {109},
number = {23-24},
pages = {1227-1231},
}