[poulson]

Sparse-direct solvers use graph theory to exploit nonzeros. In particular, Clique uses recursive nodal bisection ("nested dissection") for this purpose. The separators from this process end up (more-or-less) becoming cliques in the graph implied by the factored sparse matrix. Each of these cliques ends up corresponding to a dense matrix, which I then factor/solve-against using Elemental.