ACM Transactions on Mathematical Software (TOMS)
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Partitioning of VLSI circuits and systems
DAC '96 Proceedings of the 33rd annual Design Automation Conference
VLSI circuit partitioning by cluster-removal using iterative improvement techniques
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel circuit partitioning
DAC '97 Proceedings of the 34th annual Design Automation Conference
Large scale circuit partitioning with loose/stable net removal and signal flow based clustering
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
The ISPD98 circuit benchmark suite
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Fast and Robust Network Bisection Algorithm
IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
On implementation choices for iterative improvement partitioning algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Probability-based approaches to VLSI circuit partitioning
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Net cluster: a net-reduction based clustering preprocessing algorithm
Proceedings of the 2006 international symposium on Physical design
A PROBE-Based Heuristic for Graph Partitioning
IEEE Transactions on Computers
Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP)
International Journal of Geographical Information Science
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
An effective multi-level algorithm for bisecting graph
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
Future Generation Computer Systems
| Hi-index | 14.98 |
Abstract--Partitioning is a fundamental problem in diverse fields of study such as data mining, parallel processing, and the design of VLSI circuits. A new approach to partition graphs and hypergraphs is introduced. This new approach combines local and global sampling, clustering, and Tabu Search in a multilevel partitioning algorithm (TPART). TPART was implemented in a C program and compared to many state-of-the-art partitioning algorithms using a wide variety of benchmarks. TPART consistently performs well on the various benchmarks used and in comparison with other partitioning algorithms. TPART has a reasonably fast running time and it can produce a high quality partition of a graph of 262,144 nodes and 524,286 edges in less than 2 minutes CPU times on a Compaq Alpha DS20E 67/667 MHZ machine with 1GB of main memory.