Fast minimal triangulation algorithm using minimum degree criterion

Authors:
Mauro Mezzini
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2011

Citing 14
Cited 1

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

SIAM Journal on Computing
Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
The evolution of the minimum degree ordering algorithm

SIAM Review
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
A practical algorithm for making filled graphs minimal

Theoretical Computer Science
Efficient Stepwise Selection in Decomposable Models

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

Algorithmica
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)

SIAM Journal on Discrete Mathematics
Fully dynamic algorithms for chordal graphs and split graphs

ACM Transactions on Algorithms (TALG)
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree

Theoretical Computer Science
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

Theoretical Computer Science
A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network

Theoretical Computer Science

Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n 2) update-time

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We propose an algorithm for minimal triangulation which, using simple and efficient strategy, subdivides the input graph in different, almost non-overlapping, subgraphs. Using the technique of matrix multiplication for saturating the minimal separators, we show that the partition of the graph can be computed in time O(n^@a) where n^@a is the time required by the binary matrix multiplication. After saturating the minimal separators, the same procedure is recursively applied on each subgraphs. We also present a variant of the algorithm in which the minimum degree criterion is used. In this way, we obtain an algorithm that uses minimum degree criterion and at the same time produces a minimal triangulation, thus shedding new light on the effectiveness of the minimum degree heuristics.