A wide-range algorithm for minimal triangulation from an arbitrary ordering
From MaRDI portal
Publication:5468869
Recommendations
- scientific article; zbMATH DE number 1305489
- scientific article; zbMATH DE number 1947421
- Fast minimal triangulation algorithm using minimum degree criterion
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\)
Cited in
(34)- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\)
- Maximum cardinality search for computing minimal triangulations of graphs
- On the minimum chordal completion polytope
- The Evolution of the Minimum Degree Ordering Algorithm
- The minimum degree heuristic and the minimal triangulation process.
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Algorithms for unipolar and generalized split graphs
- scientific article; zbMATH DE number 7764121 (Why is no real title available?)
- Minimal triangulations of graphs: a survey
- Minimal split completions
- A vertex incremental approach for maintaining chordality
- Minimal fill in O(\(n^{2.69}\)) time
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Fast minimal triangulation algorithm using minimum degree criterion
- Lex M versus MCS-M
- The clique minimal separator decomposition of a hypergraph
- Treewidth computations. I: Upper bounds
- Organizing the atoms of the clique separator decomposition into an atom tree
- scientific article; zbMATH DE number 1305489 (Why is no real title available?)
- An introduction to clique minimal separator decomposition
- Maximal sub-triangulation in pre-processing phylogenetic data
- Graph extremities defined by search algorithms
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- Minimum average distance clique trees
- Graphs with at most two moplexes
- A note on minimal d-separation trees for structural learning
- Efficiently enumerating minimal triangulations
- Minimum fill-in of sparse graphs: kernelization and approximation
- Two characterisations of the minimal triangulations of permutation graphs
- An algorithm for constructing locally optimal min-max triangulation
- Objective Bayesian Nets for Integrating Consistent Datasets
- scientific article; zbMATH DE number 1953077 (Why is no real title available?)
- scientific article; zbMATH DE number 1947421 (Why is no real title available?)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
This page was built for publication: A wide-range algorithm for minimal triangulation from an arbitrary ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5468869)
