## How Good is Recursive Bisection? (1995)

Venue: | SIAM J. Sci. Comput |

Citations: | 87 - 4 self |

### BibTeX

@ARTICLE{Simon95howgood,

author = {Horst D. Simon and Shang-Hua Teng},

title = {How Good is Recursive Bisection?},

journal = {SIAM J. Sci. Comput},

year = {1995},

volume = {18},

pages = {1436--1445}

}

### Years of Citing Articles

### OpenURL

### Abstract

. 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 recursive bisection 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...

### Citations

10964 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context .... If we use an optimal bisection function, the resulting recursive bisection is called an Ideal Recursive Bisection. However, notice that the problem of finding an optimal bisection itself is NP-hard =-=[11]-=-. The Recursive Bisection Scheme given above is a template of practical implementations where we use the best available bisection algorithm. Our results can be extended to the case when BISECTION is a... |

500 |
Computer Solution of Large Sparse Positive Definite Systems
- George, Liu
- 1981
(Show Context)
Citation Context ...lation, sparse linear system solving, we need to partition the vertices of a graph into a given number of subsets such that the total number of edges whose endpoints are in different subsets is small =-=[2, 5, 6, 7, 16, 17, 20, 22, 24, 29]-=-. If p subsets are required, the problem is called the graph p-way partition problem. The most commonly used method for p-way partitioning, when p is a power of 2, is recursive bisection. It first div... |

488 | Partitioning sparse matrices with eigenvectors of graphs - Pothen, Simon, et al. - 1990 |

462 | An Analysis of the Finite Element Method - Stang, Fix - 1973 |

389 | TARJAN, A separator theorem for planar graphs
- LIPTON, E
- 1979
(Show Context)
Citation Context ...ectors can be relaxed to the condition of a family of f-separators, that is, every subgraph of G of s vertices has a ffi -bisection, for some constant ffi , of cost bounded by f(s). Lipton and Tarjan =-=[21]-=- and Gilbert [14] showed that if a graph has a family of f-separators, then it has a family of O(f)-bisectors. The following are some classes of graphs that have a family of small separators and hence... |

289 |
Partitioning of unstructured problems for parallel processing
- Simon
- 1991
(Show Context)
Citation Context ...lation, sparse linear system solving, we need to partition the vertices of a graph into a given number of subsets such that the total number of edges whose endpoints are in different subsets is small =-=[2, 5, 6, 7, 16, 17, 20, 22, 24, 29]-=-. If p subsets are required, the problem is called the graph p-way partition problem. The most commonly used method for p-way partitioning, when p is a power of 2, is recursive bisection. It first div... |

277 | A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience
- Barnard, Simon
- 1994
(Show Context)
Citation Context ...lation, sparse linear system solving, we need to partition the vertices of a graph into a given number of subsets such that the total number of edges whose endpoints are in different subsets is small =-=[2, 5, 6, 7, 16, 17, 20, 22, 24, 29]-=-. If p subsets are required, the problem is called the graph p-way partition problem. The most commonly used method for p-way partitioning, when p is a power of 2, is recursive bisection. It first div... |

239 |
An Approximate Max-Flow Min-Cut Theorem For Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
- Leighton, Rao
- 1988
(Show Context)
Citation Context ...s in d dimensions. 5. Approximately Balanced p-Way Partition. We observe that even though we use general edge separators (not necessarily bisection, [13, 21, 24]) or use minimum quotient separator of =-=[19]-=- at each level of a recursive partitioning scheme, we still can not guarantee the approximation ratio as long as the final partition is required to be a (perfectly balanced) p-way partition. All of th... |

233 |
A partitioning strategy for nonuniform problems on multiprocessors
- Berger
- 1987
(Show Context)
Citation Context ...P-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 =-=[2, 3, 7, 24, 29, 32]-=-. Some extended heuristics have been proposed that apply quadsection or octsection in place of bisection [18]. The published experimental results of Hendrickson and Leland [18] seems to indicate that,... |

186 | Provably good mesh generation
- Bern, Eppstein, et al.
(Show Context)
Citation Context ... is complemented by two positive results. 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 =-=[4, 9, 24, 25, 28]-=-, recursive bisection is within a constant factor of the optimal one in the expected case. In particular, it follows from a result of Miller, Teng, Thurston, and Vavasis [24] that recursive bisection ... |

182 |
Generalized Nested Dissection
- Lipton, Rose, et al.
- 1979
(Show Context)
Citation Context |

179 |
An improved spectral graph partitioning algorithm for mapping parallel computations
- Hendrickson, Leland
- 1995
(Show Context)
Citation Context ...tics are designed to find the best possible bisection within allowed time [2, 3, 7, 24, 29, 32]. Some extended heuristics have been proposed that apply quadsection or octsection in place of bisection =-=[18]-=-. The published experimental results of Hendrickson and Leland [18] seems to indicate that, in the context of spectral partitioning, quadsectioning and octsectioning, though more expensive than bisect... |

177 | Nested dissection of a regular finite element mesh - George - 1973 |

158 | Performance of dynamic load balancing algorithms for unstructured mesh calculations”, Concurrency: Practice and Experience
- Williams
- 1991
(Show Context)
Citation Context ...P-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 =-=[2, 3, 7, 24, 29, 32]-=-. Some extended heuristics have been proposed that apply quadsection or octsection in place of bisection [18]. The published experimental results of Hendrickson and Leland [18] seems to indicate that,... |

125 |
Spectral k-way ratio-cut partitioning and clustering
- Chan, Schlag, et al.
- 1993
(Show Context)
Citation Context ... divides a graph into two equal sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces. When p is not a power of 2, simple variants of recursive bisection=-= are used [8]-=-. Ideally, we would like to use an optimal bisection algorithm in recursive bisection. However, because the optimal bisection problem, that divides a graph into two equal sized subgraphs to minimize t... |

102 | Geometric mesh partitioning: Implementation and experiments
- Gilbert, Miller, et al.
(Show Context)
Citation Context ...and \Theta((n=p) 1\Gamma1=d ) for well-shaped meshes in d dimensions. 5. Approximately Balanced p-Way Partition. We observe that even though we use general edge separators (not necessarily bisection, =-=[13, 21, 24]-=-) or use minimum quotient separator of [19] at each level of a recursive partitioning scheme, we still can not guarantee the approximation ratio as long as the final partition is required to be a (per... |

95 | A separator theorem for graphs with an excluded minor and its applications
- Alon, Seymour, et al.
- 1990
(Show Context)
Citation Context ...S. H. TENG ffl Planar graphs [21] have a family of O( p n)-separators. ffl Bounded genus graphs [12] have a family of O( p gn)-separators, where g is the genus of the graphs. ffl Bounded minor graphs =-=[1]-=- have a family of O(h 1:5 p n)-separators, where h is the size of the largest minor clique. A minor of a graph is a subgraph obtained from the original graph by contracting edges. For example, no plan... |

90 | Efficient parallel solution of linear systems - Pan, Reif - 1985 |

81 |
A separator theorem for graphs of bounded genus
- Gilbert, Hutchinson, et al.
- 1984
(Show Context)
Citation Context ...have a family of small separators and hence have a family of small bisectors as well. 6 H. D. SIMON AND S. H. TENG ffl Planar graphs [21] have a family of O( p n)-separators. ffl Bounded genus graphs =-=[12]-=- have a family of O( p gn)-separators, where g is the genus of the graphs. ffl Bounded minor graphs [1] have a family of O(h 1:5 p n)-separators, where h is the size of the largest minor clique. A min... |

77 | Quality mesh generation in three dimensions - Mitchell, Vavasis - 1992 |

75 |
Automatic Mesh Partitioning
- Miller, Teng, et al.
- 1993
(Show Context)
Citation Context |

73 |
Iterative methods for the solution of elliptic problems on regions partitioned into substructures
- rstad, Widlund
- 1986
(Show Context)
Citation Context |

49 |
Execution Time Support for Adaptive Scientific Algorithms on
- Berryman, Saltz
- 1991
(Show Context)
Citation Context |

48 |
An Analysis of the Finite Element Method, Prentice-Hall
- Strang, Fix
- 1973
(Show Context)
Citation Context ... optimal one in the expected case. In particular, it follows from a result of Miller, Teng, Thurston, and Vavasis [24] that RB finds a p-way partition of cost O(p 1/d n 1-1/d ) for well-shaped meshes =-=[30]-=- embedded in d dimensions. Second, we show that if we relax the balance condition so that each subgraph in the partition is bounded by 2n/p, then there exists an approximately balanced recursive parti... |

34 |
Tarjan, The analysis of a nested dissection algorithm
- Gilbert, E
- 1987
(Show Context)
Citation Context ...axed to the condition of a family of f-separators, that is, every subgraph of G of s vertices has a ffi -bisection, for some constant ffi , of cost bounded by f(s). Lipton and Tarjan [21] and Gilbert =-=[14]-=- showed that if a graph has a family of f-separators, then it has a family of O(f)-bisectors. The following are some classes of graphs that have a family of small separators and hence have a family of... |

33 |
Separators: A Unified Geometric Approach to Graph Partitioning
- Points
- 1991
(Show Context)
Citation Context ...aphs and sparse graphs. A dense graph may have O(n 2 )-edges and while a sparse graph has only O(n) edges. We can further restrict that each vertex in a sparse graph has a bounded degree. As shown in =-=[31]-=-, all well shaped finite-element meshes in three dimensions are sparse. A p-way partition algorithm has approximation ratio ff, where ffs1, if for each graph G, it finds a p-way partition of cost at m... |

12 | Automated parallel solution of unstructured PDE problems, to appear. Available from http://www.cs.cmu.edu/afs/cs.cmu.edu/project/qu~e/public/ papers/pde.color.ps
- Ghattas, Miller, et al.
(Show Context)
Citation Context |

11 |
Results on triangulation and high quality mesh generation
- Ruppert
- 1992
(Show Context)
Citation Context ... is complemented by two positive results. 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 =-=[4, 9, 24, 25, 28]-=-, recursive bisection is within a constant factor of the optimal one in the expected case. In particular, it follows from a result of Miller, Teng, Thurston, and Vavasis [24] that recursive bisection ... |

11 |
E#cient parallel solution of linear systems
- Pan, Reif
- 1985
(Show Context)
Citation Context ...ion, and sparse linear system solving, we need to partition the vertices of a graph into a given number of subsets such that the total number of edges whose endpoints are in di#erent subsets is small =-=[2, 5, 6, 7, 15, 16, 17, 20, 22, 23, 24, 26, 27, 29]-=-. If p subsets are required, the problem is called the graph p-way partition problem. The most commonly used method for p-way partitioning, when p is a power of two, is RB. It first divides a graph in... |

11 | A separator-based framework for automated partitioning and mapping of parallel algorithms for numerical solution of PDEs
- Schwabe, Blelloch, et al.
- 1992
(Show Context)
Citation Context ...arch Center, Moffett Field, CA 94035. 1 processing is to map irregular and unstructured computations onto a distributed memory parallel machine to achieve load balance and to reduce communication cost=-=[2, 27, 6, 28, 32]-=-. In particular, to process a computational task, which is represented by a graph G whose edges give the communication pattern and whose nodes represent the computations, on a parallel machine of p pr... |

10 |
On sparse graphs with dense long paths
- Erdös, Graham, et al.
- 1975
(Show Context)
Citation Context ...parators of a sparse expander of n vertices have cost\Omega\Gamma n). One way to construct an expander is to choose a random bounded degree graph. It follows from a result of Erdos, Graham, Szemeredi =-=[10]-=- that all ffi -edge-separators of almost all such linear sized graphs have cost \Omega\Gamma n). The optimal 4-way partition divides the graph into A i [B i , 1sis4. The total cut size is 12. In contr... |

9 |
Guaranteed Quality Triangular Meshes
- Chew
- 1989
(Show Context)
Citation Context ... is complemented by two positive results. 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 =-=[4, 9, 24, 25, 28]-=-, recursive bisection is within a constant factor of the optimal one in the expected case. In particular, it follows from a result of Miller, Teng, Thurston, and Vavasis [24] that recursive bisection ... |

9 |
Separators: A Unified Geometric Approach to Graph Partitioning
- TENG, Points
- 1991
(Show Context)
Citation Context ...e graphs and sparse graphs. A dense graph may have O(n 2 )-edges while a sparse graph has only O(n) edges. We can further restrict that each vertex in a sparse graph has a bounded degree. As shown in =-=[31]-=-, all well-shaped finite-element meshes in three dimensions are sparse. A p-way partition algorithm has approximation ratio #, where # # 1, if for each graph G it finds a p-way partition of cost at mo... |

7 |
Mapping Unstructured Grid Problems to Massively Parallel Computers
- Hammond
- 1992
(Show Context)
Citation Context |

6 |
Area Efficient VLSI Computation. Foundations of Computing
- Leiserson
- 1983
(Show Context)
Citation Context |

5 | The solution of mesh equations on a parallel computer - Liu - 1974 |

5 |
Automatic mesh partitioning. in Sparse Matrix Computations: Graph Theory Issues and Algorithms
- Miller, Teng, et al.
- 1993
(Show Context)
Citation Context ...ion, and sparse linear system solving, we need to partition the vertices of a graph into a given number of subsets such that the total number of edges whose endpoints are in di#erent subsets is small =-=[2, 5, 6, 7, 15, 16, 17, 20, 22, 23, 24, 26, 27, 29]-=-. If p subsets are required, the problem is called the graph p-way partition problem. The most commonly used method for p-way partitioning, when p is a power of two, is RB. It first divides a graph in... |

2 |
Area ecient VLSI computation
- Leiserson
- 1983
(Show Context)
Citation Context ...ion, and sparse linear system solving, we need to partition the vertices of a graph into a given number of subsets such that the total number of edges whose endpoints are in di#erent subsets is small =-=[2, 5, 6, 7, 15, 16, 17, 20, 22, 23, 24, 26, 27, 29]-=-. If p subsets are required, the problem is called the graph p-way partition problem. The most commonly used method for p-way partitioning, when p is a power of two, is RB. It first divides a graph in... |

2 |
Automatic Mesh Partitioning. To appear
- Miller, Teng, et al.
(Show Context)
Citation Context ...number (or weights) of edges whose endpoints are in different components. Thus, the partitioning problem has applications in both direct and iterative methods for sparse linear and non-linear systems =-=[5, 6, 13, 14, 12, 15, 20, 21, 22, 24, 27]-=-. It is also an important subproblem in run-time and compiler-time optimization for high performance parallel processing [4, 6] and for VLSI layout [18]. The most commonly used approach for p-way part... |

1 | Constructing provably good cheap preconditioners for certain symmetric positive definite matrices - Vaidya - 1991 |