Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities.
Xianchao ZhangWeifa LiangGuoliang ChenPublished in: COCOON (2008)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- complex networks
- directed graph
- average degree
- edge detection
- edge information
- random graphs
- network analysis
- approximation algorithms
- connected components
- directed acyclic graph
- network structure
- minimum weight
- vertex set
- social networks
- spanning tree
- edge detector
- biological networks
- network design
- planar surfaces
- planar graphs
- multi view
- directed edges