Approximating Maximum Flow in Polygonal Domains using Spanners.

Joondong Kim Joseph S. B. Mitchell Jingyu Zou

Published in: CCCG (2009)

Keyphrases

maximum flow
minimum cut
directed graph
finite set of points
directed networks
pairwise
min cut max flow
linear programming
image understanding
flow network