Minimal elimination ordering for graphs of bounded degree
From MaRDI portal
Publication:5957302
DOI10.1016/S0166-218X(00)00331-0zbMath0998.05061MaRDI QIDQ5957302
Publication date: 24 November 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Minimal triangulations of graphs: a survey ⋮ Revisiting Decomposition by Clique Separators ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ Minimal elimination ordering for graphs of bounded degree
Cites Work
- Unnamed Item
- Characterizations of strongly chordal graphs
- A characterisation of rigid circuit graphs
- Triangulated graphs and the elimination process
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Computing the Minimum Fill-In is NP-Complete
- Algorithmic Aspects of Vertex Elimination on Graphs
- How to use the minimal separators of a graph for its chordal triangulation
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- Minimal elimination ordering for graphs of bounded degree
This page was built for publication: Minimal elimination ordering for graphs of bounded degree
