Pages that link to "Item:Q1589427"
From MaRDI portal
The following pages link to A practical algorithm for making filled graphs minimal (Q1589427):
Displaying 25 items.
- 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)
- Minimizing elimination tree height can increase fill more than linearly (Q671941) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Safe separators for treewidth (Q819825) (← 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)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- The tree-width of C (Q2174562) (← 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)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2911621) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering (Q3642841) (← links)
- Making an arbitrary filled graph minimal by removing fill edges (Q4375644) (← links)
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
