Minimum degree algorithm
= Minimum degree algorithm
At each step choose a remaining vertex of minimum degree in the current <elimination graph>. This heuristic reduces the size of the immediate <Schur complement> update and often reduces <fill-in>, but does not guarantee a globally optimal ordering. Its degrees must reflect earlier fill, rather than just the original <graph>.