Results 1  10
of
170,145
Tree Decomposition With Small Cost
 IN PROCEEDINGS 8TH SWAT, LNCS
, 2002
"... The fcost of a tree decomposition (fX i j i 2 Ig; T = (I; F )) for a function f : N ! R is defined as f(jX i j). This measure associates with the running time or memory use of some algorithms that use the tree decomposition. In this paper we investigate the problem to find tree decompositions of mi ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
The fcost of a tree decomposition (fX i j i 2 Ig; T = (I; F )) for a function f : N ! R is defined as f(jX i j). This measure associates with the running time or memory use of some algorithms that use the tree decomposition. In this paper we investigate the problem to find tree decompositions
Minimum Size TreeDecompositions?
"... Abstract. TreeDecompositions are the cornerstone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute treedecomposition ..."
Abstract
 Add to MetaCart
Abstract. TreeDecompositions are the cornerstone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute treedecompositions
TreeDecompositions Of Graphs
, 1996
"... Treedecompositions of graphs play an important role in graph structure theory, in the theory of algorithms and in practical computation. These notes survey the first two aspects. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Treedecompositions of graphs play an important role in graph structure theory, in the theory of algorithms and in practical computation. These notes survey the first two aspects.
Definable tree decompositions
 In Proceedings of the 23rd IEEE Symposium on Logic in Computer Science
, 2008
"... We introduce a notion of definable tree decompositions of graphs. Actually, a definable tree decomposition of a graph is not just a tree decomposition, but a more complicated structure that represents many different tree decompositions of the graph. It is definable in the graph by a tuple of formula ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We introduce a notion of definable tree decompositions of graphs. Actually, a definable tree decomposition of a graph is not just a tree decomposition, but a more complicated structure that represents many different tree decompositions of the graph. It is definable in the graph by a tuple
TreeDecompositions of Small Pathwidth
, 2000
"... Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeo between width and pathwidth of treedecompositions. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeo between width and pathwidth of treedecompositions.
Graph minors. X. Obstructions to treedecomposition
 J. COMB. THEORY, SERIES B
, 1991
"... Roughly, a graph has small “treewidth” if it can be constructed by piecing small graphs together in a tree structure. Here we study the obstructions to the existence of such a tree structure. We find, for instance: (i) a minimax formula relating treewidth with the largest such obstructions (ii) an ..."
Abstract

Cited by 213 (10 self)
 Add to MetaCart
) an association between such obstructions and large grid minors of the graph (iii) a “treedecomposition” of the graph into pieces corresponding with the obstructions. These results will be of use in later papers.
Metaheuristic Algorithms and Tree Decomposition
"... This chapter deals with the application of evolutionary approaches and other metaheuristic techniques for generating tree decompositions. Tree decomposition is a concept introduced by Robertson and Seymour [34] and it is used to characterize the difficulty of constraint satisfaction and NPhard prob ..."
Abstract
 Add to MetaCart
This chapter deals with the application of evolutionary approaches and other metaheuristic techniques for generating tree decompositions. Tree decomposition is a concept introduced by Robertson and Seymour [34] and it is used to characterize the difficulty of constraint satisfaction and NP
Guiding SAT Diagnosis with Tree Decompositions
 in Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT
, 2004
"... A tree decomposition of a hypergraph is a construction that captures the graph's topological structure. Every tree decomposition has an associated tree width, which can be viewed as a measure of how treelike the original hypergraph is. Tree decomposition has proven to be a very useful theor ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
A tree decomposition of a hypergraph is a construction that captures the graph's topological structure. Every tree decomposition has an associated tree width, which can be viewed as a measure of how treelike the original hypergraph is. Tree decomposition has proven to be a very useful
Query Evaluation via TreeDecompositions
 JOURNAL OF THE ACM
, 2001
"... A number of efficient methods for evaluating firstorder and monadicsecond order queries on finite relational structures are based on treedecompositions of structures or queries. We systematically study these methods. In the first part of the paper we consider arbitrary formulas on treelike struc ..."
Abstract

Cited by 104 (16 self)
 Add to MetaCart
A number of efficient methods for evaluating firstorder and monadicsecond order queries on finite relational structures are based on treedecompositions of structures or queries. We systematically study these methods. In the first part of the paper we consider arbitrary formulas on tree
Small Diameter Bag TreeDecompositions
, 2004
"... This paper deals with the length of a RobertsonSeymour's treedecomposition. The treelength ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper deals with the length of a RobertsonSeymour's treedecomposition. The treelength
Results 1  10
of
170,145