Results 1 to 10 of about 5,064 (201)
Characterizing width two for variants of treewidth [PDF]
Discrete Applied Mathematics, 2017 In this paper, we consider the notion of special treewidth , recently introduced by Courcelle (2012). In a special tree decomposition, for each vertex vv in a given graph, the bags containing vv form a rooted path.
Seongmin Ok +2 more
exaly +3 more sources
Treewidth computations II. Lower bounds [PDF]
Information and Computation, 2011 For several applications, it is important to be able to compute the treewidth of a given graph and to find tree decompositions of small width reasonably fast.
Arie Koster, Hans Bodlaender
exaly +3 more sources
Some of the next articles are maybe not open access.
Treewidth computations I. Upper bounds
Information and Computation, 2010Arie Koster, Hans Bodlaender
exaly
The Pathwidth and Treewidth of Cographs
SIAM Journal on Discrete Mathematics, 1993Hans Bodlaender, Rolf MÖHRING
exaly
A bound on the treewidth of planar even-hole-free graphs
Discrete Applied Mathematics, 2010Ana Silva, Claudia Linhares Sales
exaly
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
ACM Transactions on Algorithms, 2018Saket Saurabh +2 more
exaly
On the complexity of some colorful problems parameterized by treewidth
Information and Computation, 2011Saket Saurabh +2 more
exaly