𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms

✍ Scribed by Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter

Book ID
118197724
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
270 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A grid-enabled distributed branch-and-bo
A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs
✍ Lúcia M.A. Drummond; Eduardo Uchoa; Alexandre D. Gonçalves; Juliana M.N. Silva; 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 201 KB

This work introduces a distributed branch-and-bound algorithm to be run on computational Grids. Grids are often organized in a hierarchical fashion: clusters of processors connected via high-speed links, while the clusters themselves are geographically distant and connected through slower links. Our