5 search results - page 1 / 1 » Network flow interdiction on planar graphs |
DAM
2010
13 years 5 months ago
2010
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
EMMCVPR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...