Minimal elimination ordering for graphs of bounded degree
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4076453 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Characterizations of strongly chordal graphs
- Computing the Minimum Fill-In is NP-Complete
- How to use the minimal separators of a graph for its chordal triangulation
- Minimal elimination ordering for graphs of bounded degree
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Triangulated graphs and the elimination process
Cited in
(11)- Minimal elimination ordering for graphs of bounded degree
- Elimination properties for minimal dominating sets of graphs
- On Linear Recognition of Tree-Width at Most Four
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Minimal triangulations of graphs: a survey
- Minimum Degree Orderings
- Revisiting decomposition by clique separators
- The Evolution of the Minimum Degree Ordering Algorithm
- Minimal elimination of planar graphs
- scientific article; zbMATH DE number 1107728 (Why is no real title available?)
- scientific article; zbMATH DE number 1145349 (Why is no real title available?)
This page was built for publication: Minimal elimination ordering for graphs of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957302)