Edge-Disjoint Paths in Permutation Graphs.
C. P. GopalakrishnanC. Pandu RanganPublished in: ISAAC (1994)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- spanning tree
- graph structure
- connected components
- directed acyclic graph
- random graphs
- connected graphs
- adjacency matrix
- graph theoretic
- weighted graph
- graph matching
- random walk
- multiscale
- minimum cost
- series parallel
- vertex set
- gray level
- pairwise
- reinforcement learning
- minimum spanning trees
- image processing