Journal of Combinatorial Optimization

, Volume 1, Issue 1, pp 79–104

Moments of Inertia and Graph Separators


  • Keith D. Gremban
    • Advanced Information Systems DivisionCTA Inc
  • Gary L. Miller
    • School of Computer ScienceCarnegie Mellon University
  • Shang-Hua Teng
    • School of Computer ScienceCarnegie Mellon University

DOI: 10.1023/A:1009763020645

Cite this article as:
Gremban, K.D., Miller, G.L. & Teng, S. Journal of Combinatorial Optimization (1997) 1: 79. doi:10.1023/A:1009763020645


Graphs that arise from the finite element or finite difference methods often include geometric information such as the coordinates of the nodes of the graph. The geometric separator algorithm of Miller, Teng, Thurston, and Vavasis uses some of the available geometric information to find small node separators of graphs. The algorithm utilizes a random sampling technique based on the uniform distribution to find a good separator. We show that sampling from an elliptic distribution based on the inertia matrix of the graph can significantly improve the quality of the separator. More generally, given a cost function f on the unit d-sphere Ud, we can define an elliptic distribution based on the second moments of f. The expectation of f with respect to the elliptic distribution is less than or equal to the expectation with respect to the uniform distribution, with equality only in degenerate cases. We also demonstrate experimentally that the benefit gained by the use of the additional geometric information is significant. Some previous algorithms have used the moments of inertia heuristically, and suffer from extremely poor worst case performance. This is the first result, to our knowledge, that incorporates the moments of inertia into a provably good strategy.

Copyright information

© Kluwer Academic Publishers 1997