Optimal decomposition by clique separators
From MaRDI portal
Publication:2366013
Recommendations
Cites work
- scientific article; zbMATH DE number 3845624 (Why is no real title available?)
- scientific article; zbMATH DE number 4110748 (Why is no real title available?)
- scientific article; zbMATH DE number 3481687 (Why is no real title available?)
- scientific article; zbMATH DE number 3509596 (Why is no real title available?)
- scientific article; zbMATH DE number 3319996 (Why is no real title available?)
- A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
- Algorithmic Aspects of Vertex Elimination on Graphs
- Decomposition by clique separators
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Homomorphiebasen von Graphenmengen
- Incidence matrices and interval graphs
- Markov fields and log-linear interaction models for contingency tables
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- On rigid circuit graphs
- On the Desirability of Acyclic Database Schemes
- Representation of a finite graph by a set of intervals on the real line
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Simplicial decompositions of graphs - some uniqueness results
- Simplicial decompositions of graphs: A survey of applications
- Simplicial tree-decompositions of infinite graphs. I
- Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions
- Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions
- Triangulated graphs and the elimination process
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
Cited in
(63)- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- scientific article; zbMATH DE number 4016952 (Why is no real title available?)
- Computing the hull and interval numbers in the weakly toll convexity
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- Structural conditions for cycle completable graphs
- Organizing the atoms of the clique separator decomposition into an atom tree
- Equivalence between hypergraph convexities
- A new algorithm for decomposition of graphical models
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- Trees of tangles in abstract separation systems
- Representing a concept lattice by a graph
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
- Complexity aspects of the triangle path convexity
- Safe separators for treewidth
- The clique minimal separator decomposition of a hypergraph
- Decomposition by clique separators
- Canonical and monophonic convexities in hypergraphs
- scientific article; zbMATH DE number 7743715 (Why is no real title available?)
- Inapproximability results related to monophonic convexity
- On CLIQUE Problem for Sparse Graphs of Large Dimension
- A necessary condition for the equality of the clique number and the convexity number of a graph
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- Decomposition by maxclique separators
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Hyper Markov law in undirected graphical models with its applications
- Graph isomorphism in quasipolynomial time parameterized by treewidth
- Decomposition of a hypergraph by partial-edge separators
- A localization approach to improve iterative proportional scaling in Gaussian graphical models
- An introduction to clique minimal separator decomposition
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Bayesian learning of graphical vector autoregressions with unequal lag-lengths
- Revisiting decomposition by clique separators
- Applying clique-decomposition for computing Gromov hyperbolicity
- Decomposition by maxclique separators
- Partial inversion for linear systems and partial closure of independence graphs
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- An improved isomorphism test for bounded-tree-width graphs
- On decomposability of multilinear sets
- Computing a clique tree with the algorithm maximal label search
- Computing the hull number in toll convexity
- Characterizing atoms that result from decomposition by clique separators
- The maximum infection time in the geodesic and monophonic convexities
- scientific article; zbMATH DE number 5818908 (Why is no real title available?)
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Decomposition of two classes of structural models
- Fundamentals of Computation Theory
- Two classes of graphs in which some problems related to convexity are efficiently solvable
- Statistical Inference in Context Specific Interaction Models for Contingency Tables
- Decomposability of abstract and path-induced convexities in hypergraphs
- Standard imsets for undirected and chain graphical models
- Junction trees of general graphs
- Finding cut-vertices in the square roots of a graph
- Evaluating Datalog via tree automata and cycluits
- Finding the minimal set for collapsible graphical models
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
- Algorithms for convex hull finding in undirected graphical models
- Decomposable convexities in graphs and hypergraphs
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- An implementation of the iterative proportional fitting procedure by propagation trees.
- A note on minimal d-separation trees for structural learning
- On the monophonic rank of a graph
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
This page was built for publication: Optimal decomposition by clique separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366013)
