A vertex incremental approach for maintaining chordality
From MaRDI portal
(Redirected from Publication:819824)
Recommendations
- Algorithms and Computation
- Chordality preserving incremental triangular decomposition and its implementation
- An efficient representation of chordal graphs
- Maintaining chordal graphs dynamically: improved upper and lower bounds
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- On the effectiveness of the incremental approach to minimal chordal edge modification
- Approximation and kernelization for chordal vertex deletion
- Approximation and kernelization for chordal vertex deletion
- Feedback vertex set inspired kernel for chordal vertex deletion
- Feedback vertex set inspired kernel for chordal vertex deletion
Cites work
- A characterisation of rigid circuit graphs
- A chordal preconditioner for large-scale optimization
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- A practical algorithm for making filled graphs minimal
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for weakly triangulated graphs
- An efficient algorithm for finding a two-pair, and its applications
- Complexity classification of some edge modification problems
- Computing the Minimum Fill-In is NP-Complete
- Counting clique trees and computing perfect elimination schemes in parallel
- Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
- Generating weakly triangulated graphs
- scientific article; zbMATH DE number 3847425 (Why is no real title available?)
- scientific article; zbMATH DE number 1305489 (Why is no real title available?)
- scientific article; zbMATH DE number 1305520 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1107728 (Why is no real title available?)
- scientific article; zbMATH DE number 1947421 (Why is no real title available?)
- scientific article; zbMATH DE number 1445284 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- Incidence matrices and interval graphs
- Maximal chordal subgraphs
- Maximal sub-triangulation in pre-processing phylogenetic data
- Maximum cardinality search for computing minimal triangulations of graphs
- On rigid circuit graphs
- On the Desirability of Acyclic Database Schemes
- Optimizing weakly triangulated graphs
- Recognizing weakly triangulated graphs by edge separability
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The Pathwidth and Treewidth of Cographs
Cited in
(17)- Dynamically maintaining split graphs
- Maintaining chordal graphs dynamically: improved upper and lower bounds
- An introduction to clique minimal separator decomposition
- Minimal comparability completions of arbitrary graphs
- Tree decomposition and discrete optimization problems: a survey
- Characterizing and Computing Minimal Cograph Completions
- Organizing the atoms of the clique separator decomposition into an atom tree
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- Algorithms and Computation
- Contracting chordal graphs and bipartite graphs to paths and trees
- Computing and listing avoidable vertices and paths
- Computing and listing avoidable vertices and paths
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- On the effectiveness of the incremental approach to minimal chordal edge modification
- Two methods for the generation of chordal graphs
- Treewidth computations. I: Upper bounds
- Characterizing and computing minimal cograph completions
This page was built for publication: A vertex incremental approach for maintaining chordality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819824)
