Vertex-disjoint paths and edge-disjoint branchings in directed graphs.
Robin W. WhittyPublished in: J. Graph Theory (1987)
Keyphrases
- disjoint paths
- edge disjoint
- directed graph
- spanning tree
- undirected graph
- total length
- minimum weight
- random walk
- minimum cost
- directed acyclic graph
- maximum flow
- vertex set
- neural network
- weighted graph
- graph structure
- machine learning
- data sets
- structured data
- running times
- edge weights
- shortest path problem
- dynamic programming
- query processing