Login / Signup
Shorest Edge-Disjoint Paths in Graphs.
Andreas Schwill
Published in:
STACS (1989)
Keyphrases
</>
disjoint paths
undirected graph
directed graph
approximation algorithms
connected components
spanning tree
random graphs
directed acyclic graph
minimum cost
random walk
graph structure
graph partitioning
graph theory
graph structures
graph databases
neural network
minimum spanning trees