Publisher
Springer Berlin Heidelberg
Reference105 articles.
1. Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. on Matrix Analysis and Applications 17, 886–905 (1996)
2. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of UAI (2001)
3. Aris, R.: The optimal design of chemical reactors. Academic Press, New York (1961)
4. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey. BIT 25, 2–23 (1985)
5. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8(2), 277–284 (1987)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献