Organizing the atoms of the clique separator decomposition into an atom tree
From MaRDI portal
Publication:406311
DOI10.1016/J.DAM.2014.05.030zbMATH Open1297.05051OpenAlexW2071628652MaRDI QIDQ406311FDOQ406311
Authors: Anne Berry, Romain Pogorelcnik, Geneviève Simonet 
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.030
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
- An algorithm for the decomposition of graphs into cliques
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Decomposition by clique separators
- Incidence matrices and interval graphs
- On rigid circuit graphs
- Three Partition Refinement Algorithms
- Optimal decomposition by clique separators
- Triangulated graphs and the elimination process
- Minimal triangulations of graphs: a survey
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- New applications of clique separator decomposition for the maximum weight stable set problem
- Title not available (Why is that?)
- Characterizations and algorithmic applications of chordal graph embeddings
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- An algorithm for finding clique cut-sets
- Separability generalizes Dirac's theorem
- A practical algorithm for making filled graphs minimal
- Graph extremities defined by search algorithms
- An introduction to clique minimal separator decomposition
- An efficient algorithm for finding a two-pair, and its applications
- Maximum cardinality search for computing minimal triangulations of graphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Moplex orderings generated by the LexDFs algorithm
- Moplex elimination orderings
- A peep through the looking glass: articulation points in lattices
- BetweenO(nm) andO(nalpha)
- A Unified View of Graph Searching
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Triangulation and clique separator decomposition of claw-free graphs
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- A general label search to investigate classical graph search algorithms
- A vertex incremental approach for maintaining chordality
- Safe separators for treewidth
- Minimal fill in O(\(n^{2.69}\)) time
Cited In (5)
- The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models
- Applying clique-decomposition for computing Gromov hyperbolicity
- Computing a clique tree with the algorithm maximal label search
- Finding cut-vertices in the square roots of a graph
- Revisiting Decomposition by Clique Separators
Uses Software
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)
