The following pages link to (Q4373676):
Displaying 14 items.
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← 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)
- Minimal elimination of planar graphs (Q5054857) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
