Minimal fill in O(\(n^{2.69}\)) time

DOI10.1016/j.disc.2005.12.009zbMath1084.05070OpenAlexW1984781387MaRDI QIDQ819828

Dieter Kratsch, Jeremy P. Spinrad

Publication date: 29 March 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.009

zbMATH Keywords

triangulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Minimal triangulations of graphs: a survey ⋮ An introduction to clique minimal separator decomposition ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Revisiting Decomposition by Clique Separators ⋮ Minimal comparability completions of arbitrary graphs ⋮ Minimal proper interval completions ⋮ Minimal split completions ⋮ A note on minimal d-separation trees for structural learning ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Decomposition by clique separators
• Gaussian elimination is not optimal
• The Use of Linear Graphs in Gauss Elimination
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The Complexity of the Partial Order Dimension Problem
• A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• A wide-range algorithm for minimal triangulation from an arbitrary ordering

This page was built for publication: Minimal fill in O(\(n^{2.69}\)) time