✦ LIBER ✦

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

✍ Scribed by Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log m) parallel algorithm for the m

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB

An O(n-log-log-n) Time Algorithm for Con

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An O(n log n) feasibility algorithm for

✍ Mohan Ahuja; Yahui Zhu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 494 KB