Author:
Berry Anne,Heggernes Pinar,Villanger Yngve
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference36 articles.
1. An efficient algorithm for finding a two-pair, and its applications;Arikati;Discrete Appl. Math.,1991
2. A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring;Balas;Discrete Appl. Math.,1986
3. On the desirability of acyclic database systems;Beeri;J. Assoc. Comput. Mach.,1983
4. A. Berry, A wide-range efficient algorithm for minimal triangulation, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.
5. Maximum cardinality search for computing minimal triangulations of graphs;Berry;Algorithmica,2004
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献