Logarithmic hardness of the undirected edge-disjoint paths problem.
Matthew AndrewsLisa ZhangPublished in: J. ACM (2006)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- worst case
- approximation algorithms
- np hard
- random walk
- spanning tree
- computational complexity
- minimum cost
- directed acyclic graph
- information theoretic
- upper bound
- learning theory
- lower bound
- np hardness
- connected components
- shortest path
- np complete
- edge information
- neural network