Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
type: Item
instance of: scholarly article
title: Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
zbMATH Open document ID: 1452.62129
author: Alun Thomas
author: P. J. Green
published in: Computational Statistics and Data Analysis
publication date: 2010-03-30T00:00:00Z
full work available at URL: pmc2680312
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5687841
describes a project that uses: HdBCS
MaRDI profile type: Publication
OpenAlex ID: W2065410169
Wikidata QID: Q43130215
cites work: Sparse graphical models for exploring gene expression data
cites work: Decomposition of maximum likelihood in mixed graphical interaction models
cites work: Decomposable graphical Gaussian model determination
cites work: Monte Carlo sampling methods using Markov chains and their applications
cites work: BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
cites work: Experiments in stochastic computation for high-dimensional graphical models
cites work: Q4382293
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
DOI: 10.1016/J.CSDA.2008.10.029
DBLP publication ID: journals/csda/ThomasG09
description: scientific article; zbMATH DE number 5687841