Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. A wide-range efficient algorithm for minimal triangulation;Berry,1999
3. Maximum cardinality search for computing minimal triangulations of graphs;Berry;Algorithmica,2004
4. A. Berry, J. Bordat, P. Heggernes, G. Simonet, Y. Villanger, A wide-range algorithm for minimal triangulation from an arbitrary ordering, J. Algorithms 58 (1) (2006) 33–66.
5. A. Berry, P. Heggernes, Y. Villanger, A vertex incremental approach for dynamically maintaining chordal graphs, in: Proceedings of the 14th International Symposium on Algorithms and Computation-ISAAC 2003, Lecture Notes in Computer Science, vol. 2906, Springer, Berlin, 2003, pp. 47 – 57.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献