Pages that link to "Item:Q4645172"
From MaRDI portal
The following pages link to How to use the minimal separators of a graph for its chordal triangulation (Q4645172):
Displayed 10 items.
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Minimal elimination of planar graphs (Q5054857) (← links)
- (Q5126619) (← links)
- Minimal elimination ordering for graphs of bounded degree (Q5957302) (← links)