Keyphrases
- planar graphs
- disjoint paths
- undirected graph
- approximation algorithms
- np hard
- directed graph
- minimum cost
- directed acyclic graph
- np complete
- complex networks
- connected components
- spanning tree
- graph structure
- worst case
- boundary points
- minimum weight
- computational complexity
- optimal solution
- approximate inference
- random walk
- special case