A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Every drawing of a non-planar graph G in the plane induces a planarization, i.e., a planar graph obtained by replacing edge crossings with dummy vertices. In this paper, we consider the relationship between the capacity of a minimum st-cut in a graph G and its planarizations. We show that these capacities need not be equal. On the other hand, we prove that every crossing minimal planarization can be efficiently transformed into another crossing minimal planarization that preserves the capacitydoi:10.1016/j.endm.2007.01.036 fatcat:cxsebbtjlne2rkhnacydltmizi