A practical algorithm for making filled graphs minimal
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 1107728 (Why is no real title available?)
- scientific article; zbMATH DE number 2068046 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Chordal completions of planar graphs
- Computing the Minimum Fill-In is NP-Complete
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- Making an arbitrary filled graph minimal by removing fill edges
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Sparse matrix test problems
Cited in
(26)- Lex M versus MCS-M
- Characterizing and computing minimal cograph completions
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
- Organizing the atoms of the clique separator decomposition into an atom tree
- Tree decomposition and discrete optimization problems: a survey
- Minimal split completions
- A vertex incremental approach for maintaining chordality
- Minimal fill in O(\(n^{2.69}\)) time
- Safe separators for treewidth
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- scientific article; zbMATH DE number 2095795 (Why is no real title available?)
- Minimal triangulations of graphs: a survey
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- Fast minimal triangulation algorithm using minimum degree criterion
- The General Minimum Fill-In Problem
- Characterizing and Computing Minimal Cograph Completions
- Minimum fill-in of sparse graphs: kernelization and approximation
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
- Treewidth computations. I: Upper bounds
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Making an arbitrary filled graph minimal by removing fill edges
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- The tree-width of C
- Efficiently enumerating minimal triangulations
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Minimizing elimination tree height can increase fill more than linearly
Describes a project that uses
Uses Software
This page was built for publication: A practical algorithm for making filled graphs minimal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589427)
