𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two feedback problems for graphs with bounded tree-width

✍ Scribed by Shaoqiang Zhang; Guojun Li; Moo-Young Sohn


Book ID
107500688
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2004
Tongue
English
Weight
292 KB
Volume
19
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Layout of Graphs with Bounded Tree-Width
✍ Dujmovic, Vida; Morin, Pat; Wood, David R. πŸ“‚ Article πŸ“… 2005 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 328 KB
Efficient Parallel Algorithms for Graphs
✍ 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