✦ LIBER ✦

Dynamic Algorithms for Graphs of Bounded Treewidth

✍ Scribed by T. Hagerup

Publisher: Springer
Year: 2000
Tongue: English
Weight: 181 KB
Volume: 27
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004530010021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

I/O-Efficient Algorithms for Graphs of B

I/O-Efficient Algorithms for Graphs of Bounded Treewidth

✍ Anil Maheshwari; Norbert Zeh 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 976 KB

On bounded treewidth duality of graphs

✍ Ne?et?il, Jaroslav; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is

Channel assignment on graphs of bounded

Channel assignment on graphs of bounded treewidth

✍ Colin McDiarmid; Bruce Reed 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Efficient and Constructive Algorithms fo

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

✍ Hans L. Bodlaender; Ton Kloks 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 373 KB

In this paper we give, for all constants k, l, explicit algorithms that, given a graph Ž . Gs V,E with a tree-decomposition of G with treewidth at most l, decide Ž . whether the treewidth or pathwidth of G is at most k, and, if so, find a Ž . tree-decomposition or path-decomposition of G of width at

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi

A spectral lower bound for the treewidth

A spectral lower bound for the treewidth of a graph and its consequences

✍ L.Sunil Chandran; C.R. Subramanian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We give a lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. We use this lower bound to show that the treewidth of a d-dimensional hypercube is at least 3 We generalize this result to Hamming graphs. We also observe that every graph G on n v