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