On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method

@article{Chan1997OnTO,
  title={On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method},
  author={Tony F. Chan and Patrick Ciarlet and W. K. Szeto},
  journal={SIAM J. Scientific Computing},
  year={1997},
  volume={18},
  pages={943-948}
}
Recursive spectral bisection (RSB) is a heuristic technique for finding a minimum cut graph bisection. To use this method the second eigenvector of the Laplacian of the graph is computed and from it a bisection is obtained. The most common method is to use the median of the components of the second eigenvector to induce a bisection. We prove here that this median cut method is optimal in the sense that the partition vector induced by it is the closest partition vector, in any ls norm, for s ≥ 1… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

An analysis of spectral graph partitioning via quadratic assignment problems, in Domain Decomposition Methods in Science and Engineering

  • A. POTHEN
  • Proc. of the 7th Int’l Conf. on Domain…
  • 1995
2 Excerpts

SZETO, A sign cut version of the recursive spectral bisection graph partitioning

  • W.K.T.F. CHAN
  • Proc. of the 5th SIAM Conf. on Applied Linear…
  • 1994
1 Excerpt

LELAND, An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations, Tech. report SAND92-1460

  • R. B. HENDRICKSON
  • Sandia National Laboratory,
  • 1992
1 Excerpt

LIOU, Partitioning sparse matrices with eigenvector of graphs

  • A. POTHEN, H. SIMON, K.P
  • SIAM J. Matrix Anal. Appl.,
  • 1990
1 Excerpt

WOLKOWICZ, A Projection Technique for Partitioning the Nodes of a Graph, Tech. report

  • H. F. RENDL
  • CORR 90-20,
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…