Lex M versus MCS-M

DOI10.1016/J.DISC.2005.12.005zbMATH Open1084.05071OpenAlexW2006985873MaRDI QIDQ819832FDOQ819832

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1953077
• Maximum cardinality search for computing minimal triangulations of graphs
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• scientific article; zbMATH DE number 1305489
• scientific article; zbMATH DE number 1947421

zbMATH Keywords

algorithmschordal graphminimal triangulationelimination ordering

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Maximum cardinality search for computing minimal triangulations of graphs
• Treewidth computations. I: Upper bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819832)