Optimal partitioners and end-case placers for standard-cell layout
ISPD '99 Proceedings of the 1999 international symposium on Physical design
Update propagation protocols for replicated databates
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Multi-way partitioning using bi-partition heuristics
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Load balancing for unstructured mesh applications
Progress in computer research
A Multipole Approach for Preconditioners
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Min-Max-Boundary Domain Decomposition
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Implementing the MPI process topology mechanism
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Sourcebook of parallel computing
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning
Journal of Global Optimization
Journal of Computational Physics
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
An algorithm for improving graph partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Journal of Parallel and Distributed Computing
Multilevel Task Partition Algorithm for Parallel Simulation of Power System Dynamics
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
International Journal of Distributed Sensor Networks
Partitioning graphs into balanced components
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A new diffusion-based multilevel algorithm for computing graph partitions
Journal of Parallel and Distributed Computing
Optimal block-tridiagonalization of matrices for coherent charge transport
Journal of Computational Physics
Graph partitioning and disturbed diffusion
Parallel Computing
Congestion and almost invariant sets in dynamical systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Algorithms for the balanced edge partitioning problem
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Application of fusion-fission to the multi-way graph partitioning problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Autonomous dynamic reconfiguration in multi-agent systems: improving the quality and efficiency of collaborative problem solving
A metaheuristic based on fusion and fission for partitioning problems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tuffy: scaling up statistical inference in Markov logic networks using an RDBMS
Proceedings of the VLDB Endowment
Generic topology mapping strategies for large-scale parallel architectures
Proceedings of the international conference on Supercomputing
Discrete optimization of the multiphase piecewise constant mumford-shah functional
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Direct graph k-partitioning with a Kernighan-Lin like heuristic
Operations Research Letters
Fast balanced partitioning is hard even on grids and trees
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Efficient Entity Translation Mining: A Parallelized Graph Alignment Approach
ACM Transactions on Information Systems (TOIS)
A divide and conquer strategy for scaling weather simulations with multiple regions of interest
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Corner cuts are close to optimal: From solid grids to polygons and back
Discrete Applied Mathematics
A divide and conquer strategy for scaling weather simulations with multiple regions of interest
Scientific Programming - Selected Papers from Super Computing 2012
Hi-index | 0.01 |
The most commonly used p-way partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal-sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm. Because the optimal bisection problem that partitions a graph into two equal-sized subgraphs to minimize the number of edges cut is NP-complete, practical RB algorithms use more efficient heuristics in place of an optimal bisection algorithm. Most such heuristics are designed to find the best possible bisection within allowed time. We show that the RB method, even when an optimal bisection algorithm is assumed, may produce a p-way partition that is very far way from the optimal one. Our negative result is complemented by two positive ones: first we show that for some important classes of graphs that occur in practical applications, such as well-shaped finite-element and finite-difference meshes, RB is within a constant factor of the optimal one "almost always." Second, we show that if the balance condition is relaxed so that each block in the p-way partition is bounded by 2n/p, where n is the number of vertices of the graph, then a modified RB finds an approximately balanced $p$-way partition whose cost is within an O(log p) factor of the cost of the optimal p-way partition.