✦ LIBER ✦

The parallel complexity of coarsest set partition problems

✍ Scribed by Sang Cho; Dung T. Huynh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel algorithm for the

✍ Joseph F. Jájá; Kwan Woo Ryu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

Parallel complexity of sorting problems

✍ Martin Aigner 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 449 KB

The complexity of partition tasks

✍ Fernando Eesponda; Matías Vera-Cruz; Jorge Tarrasó; Marco Morales 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

Graph theoretic relaxations of set cover

✍ Elia El-Darzi; Gautam Mitra 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB

On the parallel complexity of hierarchic

✍ Raymond Greenlaw; Sanpawat Kantabutra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

A set partitioning heuristic for the gen

✍ Dirk.G. Cattrysse; Marc Salomon; Luk N. Van Wassenhove 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 530 KB