Login / Signup
On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem.
Claudio L. Lucchesi
Maria Cecilia M. T. Giglio
Published in:
Ars Comb. (1997)
Keyphrases
</>
disjoint paths
directed graph
undirected graph
approximation algorithms
np hard
random walk
np complete
minimum cost
graph structure
connected components
directed acyclic graph
spanning tree
real time
complex networks
shortest path
weighted graph
reinforcement learning
case study
databases