an:00529939
Zbl 0794.68114
Khuller, Samir; Naor, Joseph
Flow in planar graphs with vertex capacities
EN
Algorithmica 11, No. 3, 200-225 (1994).
00018211
1994
j
68R10 90B10
planar graphs; vertex capacities; network flow; circulation problem
Summary: Max-flow in planar graphs has always been studied with the assumption that there are capacities only on the edges. Here we consider a more general version of the problem when the vertices as well as edges have capacity constraints. In the context of general graphs considering only edge capacities is not restrictive, since the vertex-capacity problem can be reduced to the edge-capacity problem. However, in the case of planar graphs this reduction does not maintain planarity and cannot be used. We study different versions of the planar flow problem (all of which have been extensively investigated in the context of edge capacities).