Author:
Berry Anne,Wagler Annegret
Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the Desirability of Acyclic Database Schemes. Journal of the ACM (JACM) 30(3) (July 1983)
2. Berry, A.: A wide-range efficient algorithm for minimal triangulation. In: Proceedings of SODA 1999, pp. 860–861 (1999)
3. Berry, A., Blair, J.R.S., Heggernes, P., Peyton, B.W.: Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39(4), 287–298 (2004)
4. Berry, A., Blair, J.R.S., Simonet, G.: Preface to Special issue on Minimal Separation and Minimal Triangulation. Discrete Mathematics 306(3), 293 (2006)
5. Berry, A., Bordat, J.P.: Separability generalizes Dirac’s theorem. Discrete Applied Mathematics 84(1-3), 43–53 (1998)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献