Maximum Edge-Disjoint Paths in $k$-sums of Graphs
Chandra ChekuriGuyslain NavesF. Bruce ShepherdPublished in: CoRR (2013)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- directed acyclic graph
- random walk
- graph structure
- spanning tree
- graph matching
- connected components
- random graphs
- strongly connected
- complex networks
- vertex set
- minimum cost
- graph theoretic
- data structure
- graph structures
- graph representation
- input image
- graphical models
- random variables
- weighted graph
- image processing
- hough transform