How good is recursive bisection?
- Lawrence Berkeley National Lab., CA (United States)
- Massachusetts Inst. of Tech., Cambridge, MA (United States). Dept. of Mathematics
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, the authors 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. They show that the RB method, even when an optimal bisection algorithm is assumed, may produce a p-way partition that is very far away from the optimal one. The negative result is complemented by two positive ones: first they 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, they 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.
- Sponsoring Organization:
- National Aeronautics and Space Administration, Washington, DC (United States)
- OSTI ID:
- 532989
- Journal Information:
- SIAM Journal on Scientific Computing, Vol. 18, Issue 5; Other Information: PBD: Sep 1997
- Country of Publication:
- United States
- Language:
- English
Similar Records
An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers
Toward a parallel recursive spectral bisection mapping tool