An introduction to clique minimal separator decomposition
From MaRDI portal
Publication:1662549
DOI10.3390/A3020197zbMATH Open1461.05161OpenAlexW2072082202MaRDI QIDQ1662549FDOQ1662549
Authors: Anne Berry, Romain Pogorelcnik, Geneviève Simonet 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a3020197
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Decomposition by clique separators
- On rigid circuit graphs
- Optimal decomposition by clique separators
- Triangulated graphs and the elimination process
- Minimal triangulations of graphs: a survey
- Algorithmic Aspects of Vertex Elimination on Graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Computing the Minimum Fill-In is NP-Complete
- Algorithms on clique separable graphs
- Title not available (Why is that?)
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- An algorithm for finding clique cut-sets
- Maximum cardinality search for computing minimal triangulations of graphs
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- A vertex incremental approach for maintaining chordality
- Safe separators for treewidth
- Minimal fill in O(\(n^{2.69}\)) time
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Title not available (Why is that?)
Cited In (24)
- Organizing the atoms of the clique separator decomposition into an atom tree
- Trees of tangles in abstract separation systems
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- The clique minimal separator decomposition of a hypergraph
- Decomposition by clique separators
- Inapproximability results related to monophonic convexity
- On the complexity of computing treebreadth
- On the complexity of computing treebreadth
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- 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
- Decomposition by maxclique separators
- Computing a clique tree with the algorithm maximal label search
- Characterizing atoms that result from decomposition by clique separators
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- The maximum infection time in the geodesic and monophonic convexities
- Graphs with polynomially many minimal separators
- Excluding hooks and their complements
- A decomposition theorem for chordal graphs and its applications
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Evaluating Datalog via tree automata and cycluits
- On computing the Gromov hyperbolicity
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
This page was built for publication: An introduction to clique minimal separator decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662549)
