Design and implementation of move-based heuristics for VLSI hypergraph partitioning
From MaRDI portal
Publication:5463400
DOI10.1145/351827.384247zbMath1071.68532MaRDI QIDQ5463400
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/351827.384247
Algorithms; Performance; Measurement; Experimentation; VLSI CAD; Balanced min-cut hypergraph partitioning
68R10: Graph theory (including graph drawing) in computer science
68M99: Computer system organization
Related Items
New challenges in dynamic load balancing, Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem