Author:
Berry Anne,Bordat Jean-Paul,Heggernes Pinar
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. S. Arikati and P. Rangan. An efficient algorithm for finding a two-pair, and its applications. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 31, 1991.
2. A. Berry. A wide-range efficient algorithm for minimal triangulation. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99 ).
3. A. Berry. Désarticulation d’ungraphe. PhD thesis, LIRMM, Montpellier, France, 1998.
4. A. Berry, J.-P. Bordat. Minimal separators in a weakly triangulated graph. Res. Rep. LIRMM, April 2000.
5. A. Berry, J.-P. Bordat and O. Cogis. Generating all the minimal separators of a graph. In Proceedings of WG’99.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Confidentially Connected-Free Graphs;Advances in Intelligent Analysis of Medical Data and Decision Support Systems;2013
2. Maximal sub-triangulation in pre-processing phylogenetic data;Soft Computing;2005-06-07