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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We present a novel data structure, the Bayes tree, that provides an algorithmic foundation enabling a better understanding of… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset… (More)
  • table 1
  • table 3
Is this relevant?
2008
2008
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Räcke recently gave a remarkable proof showing that any undirected multicommodity flow problem can be routed in an oblivious… (More)
Is this relevant?
1999
1999
In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The nearest or near neighbor query problems arise in a large variety of database applications usually in the context of… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper, we give for constant k a linear-time algorithm that, given a graph G (V, E), determines whether the treewidth of G… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We show that for any fixed <italic>k</italic>, there is a linear-time algorithm which given a graph <italic>G</italic> either: (i… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Graphs in this paper are finite and undirected and may have loops or multiple edges. The vertexand edge-sets of a graph G are… (More)
  • figure 1
Is this relevant?