Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference51 articles.
1. A. Berry, A wide-range efficient algorithm for minimal triangulation, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’99, 1999, pp. 860–861.
2. A. Berry, J.R.S. Blair, P. Heggernes, Maximum cardinality search for computing minimal triangulations, Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, Lecture Notes in Computer Science, vol. 2573, 2002, pp. 1–12.
3. Separability generalizes Dirac's theorem;Berry;Discrete Appl. Math.,1998
4. A practical algorithm for making filled graphs minimal;Blair;Theoret. Comput. Sci.,2001
5. Testing for the consecutive ones property, internal graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献