Name
Title | ||
|---|---|---|
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 new algorithm, the Min-cut Shuffle. A detailed analysis and implementation for the algorithm is presented.
|
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/DAC.1988.14842 | DAC |
Keywords | DocType | ISBN |
network topology,software engineering,linear time,circuits,data structures,routing,algorithm design and analysis,layout design,clustering algorithms,minimization | Conference | 978-0-8186-8864-5 |
Citations | PageRank | References |
4 | 0.88 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Inderpal S. Bhandari | 1 | 517 | 62.14 |
| Mark Hirsch | 2 | 4 | 0.88 |
| Dan Siewiorek | 3 | 4642 | 1165.50 |