Organizing the atoms of the clique separator decomposition into an atom tree
From MaRDI portal
(Redirected from Publication:406311)
Recommendations
- Characterizing atoms that result from decomposition by clique separators
- Atoms and clique separators in graph products
- Revisiting decomposition by clique separators
- Decomposition by clique separators
- From tree-decompositions to clique-width terms
- Optimal decomposition by clique separators
- An introduction to clique minimal separator decomposition
- scientific article; zbMATH DE number 4053039
- scientific article; zbMATH DE number 5778727
- An algorithm for the decomposition of graphs into cliques
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- A Unified View of Graph Searching
- A general label search to investigate classical graph search algorithms
- A peep through the looking glass: articulation points in lattices
- A practical algorithm for making filled graphs minimal
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- A vertex incremental approach for maintaining chordality
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Algorithmic Aspects of Vertex Elimination on Graphs
- An algorithm for finding clique cut-sets
- An efficient algorithm for finding a two-pair, and its applications
- An introduction to clique minimal separator decomposition
- BetweenO(nm) andO(nalpha)
- Characterizations and algorithmic applications of chordal graph embeddings
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Decomposition by clique separators
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Graph Classes: A Survey
- Graph extremities defined by search algorithms
- Incidence matrices and interval graphs
- Maximum cardinality search for computing minimal triangulations of graphs
- Minimal fill in O(\(n^{2.69}\)) time
- Minimal triangulations of graphs: a survey
- Moplex elimination orderings
- Moplex orderings generated by the LexDFs algorithm
- New applications of clique separator decomposition for the maximum weight stable set problem
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On rigid circuit graphs
- Optimal decomposition by clique separators
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Safe separators for treewidth
- Separability generalizes Dirac's theorem
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Three Partition Refinement Algorithms
- Triangulated graphs and the elimination process
- Triangulation and clique separator decomposition of claw-free graphs
Cited in
(7)- The clique minimal separator decomposition of a hypergraph
- The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models
- Revisiting decomposition by clique separators
- Applying clique-decomposition for computing Gromov hyperbolicity
- Computing a clique tree with the algorithm maximal label search
- Characterizing atoms that result from decomposition by clique separators
- Finding cut-vertices in the square roots of a graph
This page was built for publication: Organizing the atoms of the clique separator decomposition into an atom tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406311)
