Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: UAI 2001: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp. 7–15. Morgan Kaufmann Publishers Inc., San Francisco (2001)
2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8, 277–284 (1987)
3. Berry, A., Bordat, J.P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Foundations Comp. Sci. 11(3), 397–403 (2000)
4. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)
5. Bouchitté, V., Kratsch, D., Müller, H., Todinca, I.: On treewidth approximations. Discrete Appl. Math. 136(2-3), 183–196 (2004)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 17. Fixed-Parameter Tractability;Frontiers in Artificial Intelligence and Applications;2021-02-02
2. Tangle bases: Revisited;Networks;2020-08-21
3. On the number of minimal separators in graphs;Journal of Graph Theory;2017-09-13
4. On the Number of Minimal Separators in Graphs;Graph-Theoretic Concepts in Computer Science;2016
5. On exact algorithms for treewidth;ACM Transactions on Algorithms;2012-12