Minimal fill in O(\(n^{2.69}\)) time
type: Item
instance of: scholarly article
title: Minimal fill in O(\(n^{2.69}\)) time
zbMATH Open document ID: 1084.05070
author: Dieter Kratsch
author: Jeremy P. Spinrad
published in: Discrete Mathematics
publication date: 2006-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5016273
zbMATH Keywords: triangulation
MaRDI profile type: Publication
full work available at URL: j.disc.2005.12.009
OpenAlex ID: W1984781387
cites work: Q4252378
cites work: A wide-range algorithm for minimal triangulation from an arbitrary ordering
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4198056
cites work: Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\)
cites work: Q4542523
cites work: Q4471361
cites work: A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
cites work: The Use of Linear Graphs in Gauss Elimination
cites work: Algorithmic Aspects of Vertex Elimination on Directed Graphs
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Gaussian elimination is not optimal
cites work: Decomposition by clique separators
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1016/J.DISC.2005.12.009
description: scientific article; zbMATH DE number 5016273