Minimal elimination ordering for graphs of bounded degree Original Research Article

We show that for graphs of bounded degree, a minimal elimination ordering can be determined in time a time bound of O(nα(n)) where α is the inverse Ackermann function. In particular, the time bound is O(n(Δ3+α(n))). Here Δ is the maximum degree of the input graph.