Flow equivalent trees in undirected node-edge-capacitated planar graphs.
Xianchao ZhangWeifa LiangHe JiangPublished in: Inf. Process. Lett. (2006)
Keyphrases
- planar graphs
- undirected graph
- weighted graph
- directed graph
- graph structure
- approximation algorithms
- directed acyclic graph
- spanning tree
- np hard
- minimum cost
- edge weights
- connected components
- tree structure
- minimum weight
- lot sizing
- complex networks
- decision trees
- routing problem
- vehicle routing problem
- shortest path
- worst case