Maximum cardinality search for computing minimal triangulations of graphs
From MaRDI portal
Publication:1882406
DOI10.1007/S00453-004-1084-3zbMATH Open1090.68080OpenAlexW2067692416MaRDI QIDQ1882406FDOQ1882406
Anne Berry, Pinar Heggernes, Jean R. S. Blair, Barry W. Peyton
Publication date: 1 October 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1084-3
Cited In (41)
- Lex M versus MCS-M
- Solving Graph Problems via Potential Maximal Cliques
- 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
- Objective Bayesian Nets for Integrating Consistent Datasets
- Tree decomposition and discrete optimization problems: a survey
- Organizing the atoms of the clique separator decomposition into an atom tree
- 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
- Triangulating planar graphs while minimizing the maximum degree
- A vertex incremental approach for maintaining chordality
- Title not available (Why is that?)
- Graphs with at most two moplexes
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Minimal triangulations of graphs: a survey
- An introduction to clique minimal separator decomposition
- Graph extremities defined by search algorithms
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- Fast minimal triangulation algorithm using minimum degree criterion
- Computing and listing avoidable vertices and paths
- Linearizing partial search orders
- Computing a clique tree with the algorithm maximal label search
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- Treewidth computations. I: Upper bounds
- Title not available (Why is that?)
- 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
- Graph Search Trees and Their Leaves
- Attachment centrality: measure for connectivity in networks
- AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
- Computing and listing avoidable vertices and paths
- Tree decompositions and social graphs
- Title not available (Why is that?)
- Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure
- Extremities and orderings defined by generalized graph search algorithms
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- A note on minimal d-separation trees for structural learning
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)
