✦ LIBER ✦

An optimal algorithm for finding compact sets

✍ Scribed by Eliezer Dekel; Jie Hu; Wen Onyang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for finding the compact

✍ Dejan Zivkovic 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 407 KB

An optimal algorithm for sink-finding

✍ K.N. King; Barbara Smith-Thomas 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 364 KB

An algorithm for finding clique cut-sets

✍ S.H. Whitesides 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 247 KB

AnO(n2) algorithm for finding the compac

✍ Chiou-Kuo Liang 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 291 KB

An optimal algorithm for finding minimal

✍ Joseph O'Rourke; Alok Aggarwal; Sanjeev Maddila; Michael Baldwin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 615 KB

An algorithm for optimal difference syst

✍ Vladimir D. Tonchev; Hao Wang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 424 KB