Pages that link to "Item:Q819823"

The following pages link to Minimal triangulations of graphs: a survey (Q819823):

Displaying 24 items.

• Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
• Search-space size in contraction hierarchies (Q306264) (← links)
• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
• An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← 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)
• The software to analyze the states of complex systems under uncertainty based on fuzzy belief network models (Q466019) (← links)
• Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
• Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← 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)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
• On the complexity of computing treelength (Q972342) (← links)
• On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
• On a property of minimal triangulations (Q1024493) (← links)
• An introduction to clique minimal separator decomposition (Q1662549) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
• Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
• (Q5126619) (← links)
• Finding cut-vertices in the square roots of a graph (Q5915963) (← links)