On some simplicial elimination schemes for chordal graphs
From MaRDI portal
Publication:2839220
DOI10.1016/j.endm.2009.02.017zbMath1267.05262OpenAlexW2963531679MaRDI QIDQ2839220
Vincent Limouzy, Michel A. Habib
Publication date: 4 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.017
Related Items (4)
Reduced clique graphs of chordal graphs ⋮ An efficient representation of chordal graphs ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Graph Classes and Forbidden Patterns on Three Vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- A characterisation of rigid circuit graphs
- Incidence matrices and interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Characterizing path graphs by forbidden induced subgraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph Classes: A Survey
This page was built for publication: On some simplicial elimination schemes for chordal graphs
