A safeness condition for minimal separators based on vertex connectivity
From MaRDI portal
Cites work
- A comparison of structural CSP decomposition methods
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Characterizations and algorithmic applications of chordal graph embeddings
- Complexity of Finding Embeddings in a k-Tree
- Fast unfolding of communities in large networks
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Graph theory
- How to use the minimal separators of a graph for its chordal triangulation
- scientific article; zbMATH DE number 1305094 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1414319 (Why is no real title available?)
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Minimal triangulations of graphs: a survey
- Necessary edges in k-chordalisations of graphs
- On the number of minimal separators in graphs
- Positive-instance driven dynamic programming for treewidth
- Preprocessing for treewidth: a combinatorial analysis through kernelization
- Safe reduction rules for weighted treewidth
- Safe separators for treewidth
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Zur allgemeinen Kurventheorie.
This page was built for publication: A safeness condition for minimal separators based on vertex connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973973)
