A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Computing the Map of Geometric Minimal Cuts
2012
Algorithmica
In this paper we consider the following problem of computing a map of geometric minimal cuts (called MGMC problem): Given a graph G = (V , E) and a planar rectilinear embedding of a subgraph H = (V H , E H ) of G, compute the map of geometric minimal cuts induced by axis-aligned rectangles in the embedding plane. The MGMC problem is motivated by the critical area extraction problem in VLSI designs and finds applications in several other fields. In this paper, we propose a novel approach based
doi:10.1007/s00453-012-9704-9
fatcat:2dkqlueigbeh5cskaatf56fnv4