Deterministic minimum-degree elimination of the sparse symmetric KKT graph.
An indexed heap chooses degree then original ordinal; eliminating a vertex
joins its remaining neighbors and releases its adjacency. This records fill
without allocating a dense N-by-N matrix. Dense fill is still possible for
intrinsically dense graphs; the factor's actual nonzeros own that cost.
Deterministic minimum-degree elimination of the sparse symmetric KKT graph. An indexed heap chooses degree then original ordinal; eliminating a vertex joins its remaining neighbors and releases its adjacency. This records fill without allocating a dense N-by-N matrix. Dense fill is still possible for intrinsically dense graphs; the factor's actual nonzeros own that cost.