Revisiting decomposition by clique separators
treewidthplanar graphsminimal triangulationbounded-degree graphsclique-numberclique minimal separator decomposition
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
- scientific article; zbMATH DE number 432771 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms on clique separable graphs
- An algorithm for finding clique cut-sets
- An introduction to clique minimal separator decomposition
- Applying clique-decomposition for computing Gromov hyperbolicity
- BetweenO(nm) andO(nalpha)
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Decomposition by clique separators
- Dually Chordal Graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Finding four-node subgraphs in triangle time
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Graph theory
- Graphs on surfaces
- Into the square: on the complexity of some quadratic-time solvable problems
- Minimal elimination of planar graphs
- Minimal elimination ordering for graphs of bounded degree
- Minimal fill in O(\(n^{2.69}\)) time
- Minimal triangulations of graphs: a survey
- On computing the Gromov hyperbolicity
- On computing the diameter of real-world undirected graphs
- On rigid circuit graphs
- On triangle path convexity in graphs
- Optimal decomposition by clique separators
- Organizing the atoms of the clique separator decomposition into an atom tree
- Powers of tensors and fast matrix multiplication
- Safe separators for treewidth
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Tree-decompositions with bags of small diameter
- Treewidth: Characterizations, Applications, and Computations
- Triangulated graphs and the elimination process
- Triangulation and clique separator decomposition of claw-free graphs
- Weighted efficient domination for P₅-free and P₆-free graphs
- Which problems have strongly exponential complexity?
- Organizing the atoms of the clique separator decomposition into an atom tree
- Bisimplicial separators
- Exact Solution Algorithms for the Chordless Cycle Problem
- Decomposition by clique separators
- Decomposition by maxclique separators
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- An introduction to clique minimal separator decomposition
- Triangulation and clique separator decomposition of claw-free graphs
- Decomposition by maxclique separators
- Finding cut-vertices in the square roots of a graph
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
- Clique partitions, graph compression and speeding-up algorithms
- scientific article; zbMATH DE number 2079402 (Why is no real title available?)
- Treelength of series-parallel graphs
- Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs
This page was built for publication: Revisiting decomposition by clique separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610181)
