Results 151 to 160 of about 278 (179)
Some of the next articles are maybe not open access.
A Note on Multiflows and Treewidth
Algorithmica, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandra Chekuri +2 more
openaire +1 more source
Approximation Algorithms for Treewidth
Algorithmica, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2014
• O.k p log k/. • For all {v;w} 2 E, there is an i 2 I with v, w 2 Xi . • For all v 2 V , the set {i 2 I jv 2 Xi} induces a connected subtree of T . The width of a tree decomposition is max i2I jXi j 1, and the treewidth of a graph G is the minimum width of a tree decomposition of G (Fig. 1). An alternative definition is in terms of chordal graphs.
openaire +3 more sources
• O.k p log k/. • For all {v;w} 2 E, there is an i 2 I with v, w 2 Xi . • For all v 2 V , the set {i 2 I jv 2 Xi} induces a connected subtree of T . The width of a tree decomposition is max i2I jXi j 1, and the treewidth of a graph G is the minimum width of a tree decomposition of G (Fig. 1). An alternative definition is in terms of chordal graphs.
openaire +3 more sources
2009
One of the most important structural parameters of graphs is treewidth , a measure for the "tree-likeness" and thus in many cases an indicator for the hardness of problem instances. The smaller the treewidth, the closer the graph is to a tree and the more efficiently the underlying instance often can be solved.
Marko Samer, Helmut Veith
openaire +1 more source
One of the most important structural parameters of graphs is treewidth , a measure for the "tree-likeness" and thus in many cases an indicator for the hardness of problem instances. The smaller the treewidth, the closer the graph is to a tree and the more efficiently the underlying instance often can be solved.
Marko Samer, Helmut Veith
openaire +1 more source
On the Treewidth of NK Landscapes
2003The 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
2007This 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
Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth.
Many classical graph problems - such as Max Cut, Chromatic Number, Edge Dominating Set, and Hamiltonian Cycle - are polynomial-time solvable on cographs, fixed-parameter tractable (FPT) when parameterized by treewidth, but W[1]-hard when parameterized by clique-width.Blažej, Václav +3 more
openaire +2 more sources
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science, 1998Hans L Bodlaender
exaly
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing, 1996Hans L Bodlaender
exaly