Edge-disjoint paths in permutation graphs.
C. P. GopalakrishnanC. Pandu RanganPublished in: Discuss. Math. Graph Theory (1995)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- random walk
- spanning tree
- directed acyclic graph
- graph structure
- random graphs
- complex networks
- connected components
- minimum cost
- graph theoretic
- graph matching
- adjacency matrix
- multiscale
- adjacency graph
- labeled graphs
- vertex set
- graph structures
- special case
- complex structures
- np hard
- probabilistic model
- scheduling problem
- weighted graph
- bayesian networks
- graph theory
- graphical models