no code implementations • 6 Nov 2020 • Chandler Squires, Joshua Amaniampong, Caroline Uhler
We compare our method with $w = 1$ to algorithms for finding sparse elimination orderings of undirected graphs, and show that taking advantage of DAG-specific problem structure leads to a significant improvement in the discovered permutation.
