Fast minimal triangulation algorithm using minimum degree criterion

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) where n is the time required by the… (More)
DOI: 10.1016/j.tcs.2011.04.022

Topics

6 Figures and Tables

Cite this paper

@article{Mezzini2011FastMT, title={Fast minimal triangulation algorithm using minimum degree criterion}, author={Mauro Mezzini}, journal={Theor. Comput. Sci.}, year={2011}, volume={412}, pages={3775-3787} }