Skip to search formSkip to main contentSkip to account menu

Tree decomposition

Known as: Clique tree, Running intersection property, Junction tree 
In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
Approximation algorithmBelief propagationBramble (graph theory)Branch-decomposition

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Growing Graphs from Hyperedge Replacement Graph Grammars
Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we… 
2013
2013
A dual scheme for compression and restoration of sequentially transmitted images over Wireless Sensor Networks
2010
2010
Perceptual color descriptor based on spatial distribution: A top-down approach
2009
2009
A Tree Decomposition Based Approach to Solve Structured SAT Instances
The main purpose of the paper is to solve structured instances of the satisfiability problem. The structure of a SAT instance is… 
2008
2008
Pathological voice classifcation using local discriminant basis and genetic algorithm
Voice feature extraction plays an important role in analyzing and characterizing voice content. The key to extract strong… 
2008
2008
Local Discriminant Wavelet Packet Basis for Voice Pathology Classification
Diagnosis of pathological voice is one of the most important issues in biomedical applications of speech technology. There are… 
2005
2005
Abductive Inference in Bayesian Networks: Finding a Partition of the Explanation Space
This paper proposes a new approach to the problem of ob- taining the most probable explanations given a set of observations in a… 
2004
2004
A DBN inference algorithm using junction tree
Dynamic bayesian networks (DBNs) is a compact representation of complex stochastic processes and has been used for many purposes… 
1997
1997
Nested Junction Trees
The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy architectures can be improved by exploiting… 
1995
1995
Clustering Without (Thinking About) Triangulation
The undirected technique for evaluating belief networks [Jensen et al., 199Oa, Lauritzen and Spiegelhalter, 1988] requires… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)