This is a preview. Log in through your library . Abstract We consider variants of the max-flow min-cut problems in the plane, motivated by models of damage, where certain sets of edges of the graph ...
In many actual network flow situations, nodes as well as arcs have limited capacities. This paper presents, for such a network, an algorithm for maximizing flow from a source node to a sink node. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback