Lex M versus MCS-M

DOI10.1016/j.disc.2005.12.005zbMath1084.05071OpenAlexW2006985873MaRDI QIDQ819832

Yngve Villanger

Publication date: 29 March 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.005

zbMATH Keywords

algorithmschordal graphminimal triangulationelimination ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Treewidth computations. I: Upper bounds

Cites Work

• Unnamed Item
• Unnamed Item
• A practical algorithm for making filled graphs minimal
• Maximum cardinality search for computing minimal triangulations of graphs
• Incidence matrices and interval graphs
• Minimal Orderings Revisited
• The Use of Linear Graphs in Gauss Elimination
• Complexity of Finding Embeddings in a k-Tree
• Computing the Minimum Fill-In is NP-Complete
• A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
• Algorithms and Computation
• A wide-range algorithm for minimal triangulation from an arbitrary ordering

This page was built for publication: Lex M versus MCS-M