On the (integral) maximum tw flow in vertex and edge capacitated planar graphs.
Frieda GranotMichal PennPublished in: IPCO (1993)
Keyphrases
- planar graphs
- undirected graph
- minimum weight
- weighted graph
- directed graph
- approximation algorithms
- spanning tree
- connected components
- complex networks
- np hard
- bipartite graph
- edge weights
- minimum cost
- directed acyclic graph
- lot sizing
- greedy heuristic
- edge information
- edge detector
- approximate inference
- vehicle routing problem
- closed form
- edge detection