1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993
2. E. Amir, Efficient approximation for triangulation of minimum treewidth, in Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI ’01), 2001. http://www.cs.berkeley.edu/~eyal/papers/decomp-uai01.ps.
3. A. Berry, Désarticulation d'un graphe, Ph.D. Thesis, Université Montpellier II, 1998.
4. Approximating treewidth, pathwidth, frontsize and shortest elimination tree;Bodlaender;J. Algorithms,1995
5. V. Bouchitté, I. Todinca, Approximating the treewidth of AT-free graphs, in Proceedings of the 26th Workshop on Graph-Theoretic Aspects in Computer Science (WG 2000), Lecture Notes in Computer Sciences, Vol. 1928, Springer, Berlin, 2000, pp. 59–70.