An Improved Min-Cut Algonthm for Partitioning VLSI Networks
From MaRDI portal
Publication:3312163
DOI10.1109/TC.1984.1676460zbMath0529.94022OpenAlexW2010346244MaRDI QIDQ3312163
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1984.1676460
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Related Items
A genetic approach for network partitioning ⋮ Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning ⋮ Moving clusters within a memetic algorithm for graph partitioning ⋮ Efficient algorithms for single- and two-layer linear placement of parallel graphs ⋮ Unnamed Item ⋮ Parallel multilevel algorithms for hypergraph partitioning ⋮ Practical Minimum Cut Algorithms ⋮ The decomposition of a communication network considering traffic demand interrelations ⋮ Reducing Rollbacks Through Partitioning in PCS Parallel Simulation