Results 221 to 230 of about 11,505 (254)
An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
Marc Distel
openalex +1 more source
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L Bodlaender, Arie M C A Koster
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Algorithms, 1997
Summary: We consider a special variant of tree-decompositions, called domino tree-decompositions, and the related notion of domino treewidth. In a domino tree- decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every \(k\), \(d\), there exists a constant \(c_{k,d}\) such that a graph with treewidth at ...
Bodlaender, Hans, Engelfriet, Joost
openaire +2 more sources
Summary: We consider a special variant of tree-decompositions, called domino tree-decompositions, and the related notion of domino treewidth. In a domino tree- decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every \(k\), \(d\), there exists a constant \(c_{k,d}\) such that a graph with treewidth at ...
Bodlaender, Hans, Engelfriet, Joost
openaire +2 more sources
Journal of Combinatorial Theory Series B, 2018 The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
David R Wood
exaly +3 more sources
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