Maximum Cardinality Search for Computing Minimal Triangulations

Authors:
Anne Berry;Jean R. S. Blair;Pinar Heggernes
Affiliations:
-;-;-
Venue:
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2002

Citing 5
Cited 4

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
A wide-range efficient algorithm for minimal triangulation

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for making filled graphs minimal

Theoretical Computer Science
Minimal Orderings Revisited

SIAM Journal on Matrix Analysis and Applications
Minimal Elimination Ordering Inside a Given Chordal Graph

WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
Treewidth computations I. Upper bounds

Information and Computation
Treewidth: characterizations, applications, and computations

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new simpler algorithm MCS-M combines the extension of Lex-M with the simplification of MCS, achieving all the results of Lex-M in the same time complexity.