Pages that link to "Item:Q5468869"

The following pages link to A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869):

Displaying 33 items.

• Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
• Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
• Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
• Algorithms for unipolar and generalized split graphs (Q741738) (← links)
• Minimal triangulations of graphs: a survey (Q819823) (← links)
• A vertex incremental approach for maintaining chordality (Q819824) (← links)
• Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
• Lex M versus MCS-M (Q819832) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• Minimal split completions (Q967310) (← links)
• A note on minimal d-separation trees for structural learning (Q969533) (← links)
• Graph extremities defined by search algorithms (Q1662546) (← links)
• An introduction to clique minimal separator decomposition (Q1662549) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
• Efficiently enumerating minimal triangulations (Q1983135) (← links)
• Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
• Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
• Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
• Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (Q2921757) (← links)
• Minimum Average Distance Clique Trees (Q2947438) (← links)
• The Evolution of the Minimum Degree Ordering Algorithm (Q3823722) (← links)
• (Q4252378) (← links)
• An algorithm for constructing locally optimal min-max triangulation (Q4346968) (← links)
• (Q4414480) (← links)
• (Q4966374) (← links)
• Objective Bayesian Nets for Integrating Consistent Datasets (Q5094018) (← links)
• On the minimum chordal completion polytope (Q5126619) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5902510) (← links)
• (Q6089678) (← links)
• Graphs with at most two moplexes (Q6595515) (← links)