minimum degree ordering
Description: An ordering of matrix or graph vertices that repeatedly selects a vertex of minimum degree, commonly used to reduce fill during sparse matrix factorization.
Primary topic: Matrix Theory and Algorithms (74%)
Related topic: Matrix Theory and Algorithms (74%)
OpenAlex ID: keywords/minimum-degree-ordering
