Login / Signup
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
Published in:
Inf. Process. Lett. (2009)
Keyphrases
</>
minimum weight
pairwise
spanning tree
real time
neural network
relational databases
data sets
computer vision
high level
reinforcement learning
search algorithm
expert systems
user interface
random walk
greedy heuristic