Author:
Berry Anne,Dahlhaus Elias,Heggernes Pinar,Simonet Geneviève
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. An approximate minimum degree ordering algorithm;Amestoy;SIAM J. Matrix Anal. Appl.,1996
2. A. Berry, Désarticulation d’un graphe, Ph.D. Dissertation, LIRMM, Montpellier, December 1998
3. Maximum cardinality search for computing minimal triangulations of graphs;Berry;Algorithmica,2004
4. A wide-range algorithm for minimal triangulation from an arbitrary ordering;Berry;J. Algorithms,2005
5. A. Berry, P. Heggernes, G. Simonet, The minimum degree heuristic and the minimal triangulation process, in: Proceedings WG 2003 — 29th Workshop on Graph Theoretic Concepts in Computer Science, June 2003, in: Lecture Notes in Computer Science, vol. 2880, pp. 58–70
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献