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

Abstract

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