PAROMETIS
It can be used to compute a fill-reducing permutation of a sparse symmetric matrix.
- Ideal for parallel Cholesky factorization.
Uses multilevel recursive bisection to compute a nested dissection ordering.
Fill-characteristics are comparable to Metis and better than minimum degree.
Leads to balanced elimination trees.