Pages that link to "Item:Q5470799"
From MaRDI portal
The following pages link to Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799):
Displaying 26 items.
- 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)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Minimal proper interval completions (Q963366) (← 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)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (Q2921757) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869) (← links)
- (Q5743514) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902510) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
