A linear-time algorithm to find a pair of arc-disjoint...

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
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
109
Year:
2009
Language:
english
Pages:
5
DOI:
10.1016/j.ipl.2009.09.004
File:
PDF, 185 KB
english, 2009
Conversion to is in progress
Conversion to is failed