๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

I/O-Efficient Algorithms for Graphs of Bounded Treewidth

โœ Scribed by Anil Maheshwari; Norbert Zeh

Publisher
Springer
Year
2007
Tongue
English
Weight
976 KB
Volume
54
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Efficient algorithms for interval graphs
Efficient algorithms for interval graphs and circular-arc graphs
โœ U. I. Gupta; D. T. Lee; J. Y.-T. Leung ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the

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