✦ LIBER ✦

An Ω(n log n) lower bound for decomposing a set of points into chains

✍ Scribed by Peter A. Bloniarz; S.S. Ravi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(kN.log N) algorithm for decomposing

✍ Sukhamay Kundu; Radhakrishnan Sridhar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 630 KB

An O(log n) time parallel algorithm for

✍ Cao An Wang; Yung H. Tsin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 439 KB