A wide-range algorithm for minimal triangulation from an arbitrary ordering
From MaRDI portal
Publication:5468869
DOI10.1016/j.jalgor.2004.07.001zbMath1093.68137OpenAlexW2063694895MaRDI QIDQ5468869
Anne Berry, Jean-Paul Bordat, Yngve Villanger, Geneviève Simonet, Pinar Heggernes
Publication date: 28 April 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1956/1147
Related Items (22)
Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Minimal fill in O(\(n^{2.69}\)) time ⋮ Lex M versus MCS-M ⋮ Unnamed Item ⋮ Graph extremities defined by search algorithms ⋮ An introduction to clique minimal separator decomposition ⋮ Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Minimum Average Distance Clique Trees ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time ⋮ Unnamed Item ⋮ Efficiently enumerating minimal triangulations ⋮ Treewidth computations. I: Upper bounds ⋮ Minimal split completions ⋮ Minimum fill-in of sparse graphs: kernelization and approximation ⋮ A note on minimal d-separation trees for structural learning ⋮ Fast minimal triangulation algorithm using minimum degree criterion ⋮ Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network ⋮ Maximal sub-triangulation in pre-processing phylogenetic data ⋮ Algorithms for unipolar and generalized split graphs ⋮ Unnamed Item
This page was built for publication: A wide-range algorithm for minimal triangulation from an arbitrary ordering
