The min-cut shuffle: toward a solution for the global effectproblem of min-cut placement

摘要

The global effect problem is introduced in the context of adaptingmin-cut partitioning for min-cut placement. A simplified version of theproblem is solved in linear time by using a novel algorithm called themin-cut shuffle. A detailed analysis and implementation for thealgorithm is presented