Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph.
Yehoshua PerlYossi ShiloachPublished in: J. ACM (1978)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- strongly connected
- weighted graph
- spanning tree
- adjacency matrix
- edge weights
- average degree
- random walk
- connected components
- graph structure
- directed acyclic graph
- directed edges
- vertex set
- minimum cost
- graph model
- complex networks
- maximum clique
- hamiltonian cycle
- minimum spanning tree
- minimum weight
- labeled graphs
- input image
- special case
- maximum matching
- pairwise