Results 231 to 240 of about 11,505 (254)

On the Treewidth of NK Landscapes

2003
The concepts of treewidth and tree-decomposition on graphs generalize those of the trees. It is well established that when restricted to instances with a bounded treewidth, many NP hard problems can be solved polynomially. In this paper, we study the treewidth of the NK landscape models.
Yong Gao 0001, Joseph C. Culberson
openaire   +1 more source

Treewidth: Structure and Algorithms

2007
This paper surveys some aspects of the graph theoretic notion of treewidth. In particular, we look at the interaction between different characterizations of the notion, and algorithms and algorithmic applications.
openaire   +2 more sources

A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science, 1998
Hans L Bodlaender
exaly  

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing, 1996
Hans L Bodlaender
exaly  

Parameters Tied to Treewidth

Journal of Graph Theory, 2017
David R Wood
exaly  

A $c^k n$ 5-Approximation Algorithm for Treewidth

SIAM Journal on Computing, 2016
Hans L Bodlaender, Fedor V Fomin, Daniel Lokshtanov   +2 more
exaly  

Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics, 1995
Hans L Bodlaender, Ton Kloks, Dieter Kratsch   +2 more
exaly  

On the Relationship Between Clique-Width and Treewidth

SIAM Journal on Computing, 2005
Derek G Corneil, Udi Rotics
exaly  

Treewidth computations I. Upper bounds

Information and Computation, 2010
Hans L Bodlaender, Arie M C A Koster
exaly  

Treewidth computations II. Lower bounds

Information and Computation, 2011
Hans L Bodlaender, Arie M C A Koster
exaly