Hardness of the undirected edge-disjoint paths problem.
Matthew AndrewsLisa ZhangPublished in: STOC (2005)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- np hard
- directed acyclic graph
- worst case
- minimum cost
- np hardness
- random walk
- computational complexity
- spanning tree
- weighted graph
- phase transition
- connected components
- graph structure
- complex networks
- binary images
- np complete
- xml documents
- neural network
- directed edges