Results 1  10
of
5,221
and Bounded Treewidth ∗
, 2008
"... We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large ’ induced subgraph H, where H has treewidth at most t and every vertex in H has degree at most d in G. The order of H depends on t, k, d, and the order of G. With t = k, we obtain large sets of bounded de ..."
Abstract
 Add to MetaCart
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large ’ induced subgraph H, where H has treewidth at most t and every vertex in H has degree at most d in G. The order of H depends on t, k, d, and the order of G. With t = k, we obtain large sets of bounded
On Bounded Treewidth Duality of Graphs
, 1999
"... We prove that for any integers m; k, there is an integer n0 such that if G is a graph of girth n0 then any partial ktree homomorphic to G is also homomorphic to C2m+1 . As a corollary, every nonbipartite graph does not have bounded treewidth duality. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We prove that for any integers m; k, there is an integer n0 such that if G is a graph of girth n0 then any partial ktree homomorphic to G is also homomorphic to C2m+1 . As a corollary, every nonbipartite graph does not have bounded treewidth duality.
A Partial KArboretum of Graphs With Bounded Treewidth
 J. Algorithms
, 1998
"... The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes ..."
Abstract

Cited by 328 (34 self)
 Add to MetaCart
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between
Patterns with bounded treewidth
 In Proc. 6th International Conference on Language and Automata Theory and Applications, LATA 2012, volume 7183 of LNCS
, 2012
"... treewidth [internal report] ..."
Recoloring bounded treewidth graphs
 In Proceedings of the 7th LatinAmerican Algorithms, Graphs, and Optimization Symposium
, 2013
"... Let k be an integer. Two vertex kcolorings of a graph are adjacent if they differ on exactly one vertex. A graph is kmixing if any proper kcoloring can be transformed into any other through a sequence of adjacent proper kcolorings. Any graph is (tw + 2)mixing, where tw is the treewidth of the g ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Let k be an integer. Two vertex kcolorings of a graph are adjacent if they differ on exactly one vertex. A graph is kmixing if any proper kcoloring can be transformed into any other through a sequence of adjacent proper kcolorings. Any graph is (tw + 2)mixing, where tw is the treewidth
Fast counting with bounded treewidth
 In Logic for Programming, Artificial Intelligence, and Reasoning, volume 5330 of LNCS
"... Stefan Woltran1 Abstract. Many intractable problems have been shown to become tractable if the treewidth of the underlying structure is bounded by a constant. An important tool for deriving such results is Courcelle’s Theorem, which states that all properties defined by MonadicSecond Order (MSO) se ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Stefan Woltran1 Abstract. Many intractable problems have been shown to become tractable if the treewidth of the underlying structure is bounded by a constant. An important tool for deriving such results is Courcelle’s Theorem, which states that all properties defined by MonadicSecond Order (MSO
Polynomials of Bounded TreeWidth
, 2001
"... We introduce a new sparsity conditions, the treewidth, on multivariate polynomials in n variables (over some ring R) and show that under this condition many otherwise intractable computational problems involving these polynomials become solvable in polynomial (in some cases even linear) time in ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We introduce a new sparsity conditions, the treewidth, on multivariate polynomials in n variables (over some ring R) and show that under this condition many otherwise intractable computational problems involving these polynomials become solvable in polynomial (in some cases even linear) time
On OBDDs for CNFs of bounded treewidth
 In KR
, 2014
"... the readonce property of branching programs and ..."
Belief Revision with Bounded Treewidth?
"... Abstract. Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, with the ones by Dalal or Satoh being two of the most fundamental ones. As is well known, most computational t ..."
Abstract
 Add to MetaCart
tasks in this area are intractable. Therefore, in practical applications, one requires sufficient conditions under which revision problems become efficiently solvable. In this paper, we identify such tractable fragments for the reasoning and the enumeration problem exploiting the notion of treewidth
Results 1  10
of
5,221