✦ LIBER ✦

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ Scribed by T. Asano

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log n) parallel algorithm for const

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A randomized algorithm for finding maxim

✍ Hing F. Ting; Andrew C. Yao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 410 KB

An O(n log n) feasibility algorithm for

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

A SimpleO(log N) Time Parallel Algo

✍ Srabani Sen Gupta; Bhabani P. Sinha 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB