✦ LIBER ✦

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

✍ Scribed by Bodlaender, Hans L.; Hagerup, Torben

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic Algorithms for Graphs of Bounded

✍ T. Hagerup 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 181 KB

Improved Steiner tree algorithms for bou

✍ Chimani, Markus; Mutzel, Petra; Zey, Bernd 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 425 KB

An upper bound for the speedup of parall

✍ Michael J. Quinn; Narsingh Deo 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 586 KB

Restricted space algorithms for isomorph

✍ Bireswar Das; Jacobo Torán; Fabian Wagner 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 297 KB

I/O-Efficient Algorithms for Graphs of B

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

Embedding Graphs with Bounded Treewidth

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 336 KB