Recursive Spectral Bisection

• Uses the discrete Laplacian

• Let A be the adjacency matrix

• Let D be the diagonal matrix where

  • D[i,i] is the degree of node I

• LG = A - D

Previous slide

Next slide

Back to first slide

View graphic version