Maximum cardinality search for computing minimal triangulations of graphs
From MaRDI portal
(Redirected from Publication:1882406)
Recommendations
Cited in
(44)- Lex M versus MCS-M
- Learning tractable Bayesian networks in the space of elimination orders
- Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
- Bayesian networks: the minimal triangulations of a graph
- Organizing the atoms of the clique separator decomposition into an atom tree
- Tree decomposition and discrete optimization problems: a survey
- Objective Bayesian Nets for Integrating Consistent Datasets
- A new algorithm for decomposition of graphical models
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- Global minimization of polynomial integral functionals
- AMP chain graphs: minimal separators and structure learning algorithms
- A vertex incremental approach for maintaining chordality
- Triangulating planar graphs while minimizing the maximum degree
- The clique minimal separator decomposition of a hypergraph
- scientific article; zbMATH DE number 6469175 (Why is no real title available?)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Graphs with at most two moplexes
- Minimal triangulations of graphs: a survey
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- An introduction to clique minimal separator decomposition
- Graph extremities defined by search algorithms
- Fast minimal triangulation algorithm using minimum degree criterion
- Computing and listing avoidable vertices and paths
- Linearizing partial search orders
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Computing a clique tree with the algorithm maximal label search
- Treewidth computations. I: Upper bounds
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- scientific article; zbMATH DE number 1953077 (Why is no real title available?)
- Tractability of most probable explanations in multidimensional Bayesian network classifiers
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Attachment centrality: measure for connectivity in networks
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Graph Search Trees and Their Leaves
- Computing and listing avoidable vertices and paths
- Tree decompositions and social graphs
- Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure
- Graph-Theoretic Concepts in Computer Science
- Extremities and orderings defined by generalized graph search algorithms
- A note on minimal d-separation trees for structural learning
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
This page was built for publication: Maximum cardinality search for computing minimal triangulations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882406)
