Publisher
Springer Nature Switzerland
Reference17 articles.
1. Bergougnoux, B., Kanté, M.M., Wasa, K.: Disjunctive minimal separators enumeration. WEPA (2019). https://www.mimuw.edu.pl/~bbergougnoux/pdf/bkw19.pdf
2. Berry, A., Bordat, J.P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Found. Comput. Sci. 11(03), 397–403 (2000)
3. Lecture Notes in Computer Science;V Bouchitté,1998
4. Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212–232 (2001)
5. Bouchitté, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theoret. Comput. Sci. 276(1–2), 17–32 (2002)