𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Layout of Graphs with Bounded Tree-Width

✍ Scribed by Dujmovic, Vida; Morin, Pat; Wood, David R.

Book ID
118181205
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
328 KB
Volume
34
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning Graphs of Bounded Tree-Widt
Partitioning Graphs of Bounded Tree-Width
✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan πŸ“‚ Article πŸ“… 1998 πŸ› Springer-Verlag 🌐 English βš– 199 KB
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

Optimal Parametric Search on Graphs of B
Optimal Parametric Search on Graphs of Bounded Tree-Width
✍ David FernΓ‘ndez-Baca; Giora Slutzki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 339 KB

We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs.