Fast minimal triangulation algorithm using minimum degree criterion
type: Item
instance of: scholarly article
title: Fast minimal triangulation algorithm using minimum degree criterion
zbMATH Open document ID: 1220.05121
author: Mauro Mezzini
published in: Theoretical Computer Science
publication date: 2011-07-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5920452
zbMATH Keywords: minimal triangulations
zbMATH Keywords: chordal graphs
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.04.022
OpenAlex ID: W2002740543
cites work: On the Desirability of Acyclic Database Schemes
cites work: Maximum cardinality search for computing minimal triangulations of graphs
cites work: A wide-range algorithm for minimal triangulation from an arbitrary ordering
cites work: Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
cites work: Graph-Theoretic Concepts in Computer Science
cites work: A practical algorithm for making filled graphs minimal
cites work: Q4288578
cites work: Convexity in Graphs and Hypergraphs
cites work: The Evolution of the Minimum Degree Ordering Algorithm
cites work: Minimal triangulations of graphs: a survey
cites work: Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
cites work: Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
cites work: Fully dynamic algorithms for chordal graphs and split graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Computing the Minimum Fill-In is NP-Complete
DOI: 10.1016/J.TCS.2011.04.022
description: scientific article; zbMATH DE number 5920452