Open ArrogantGao opened 4 months ago
[^Bouchitté]: Bouchitté, Vincent, and Ioan Todinca. “Treewidth and Minimum Fill-in: Grouping the Minimal Separators.” SIAM Journal on Computing 31, no. 1 (January 2001): 212–32. https://doi.org/10.1137/S0097539799359683.
[^Tamaki]: Tamaki, Hisao. “Heuristic Computation of Exact Treewidth.” Application/pdf, 2022, 16 pages, 743963 bytes. https://doi.org/10.4230/LIPICS.SEA.2022.17.
A improved version of the BT algorithm has been implemented, see #14
[^Bouchitté]: Bouchitté, Vincent, and Ioan Todinca. “Treewidth and Minimum Fill-in: Grouping the Minimal Separators.” SIAM Journal on Computing 31, no. 1 (January 2001): 212–32. https://doi.org/10.1137/S0097539799359683.
[^Tamaki]: Tamaki, Hisao. “Heuristic Computation of Exact Treewidth.” Application/pdf, 2022, 16 pages, 743963 bytes. https://doi.org/10.4230/LIPICS.SEA.2022.17.