✦ LIBER ✦

On O(p2) algorithms for planarization

✍ Scribed by Carson, D.I.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "O(n/sup 2/) algorithms for

✍ Takefuji, Y.; Lee, K.C.; Cho, Y.B. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 143 KB

An O(N2) algorithm for coloring perfect

✍ Alan Tucker; Donna Wilson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 501 KB

An $O ( | V |^2 )$ Algorithm for the Pla

✍ Hochbaum, Dorit S.; Shmoys, David B. 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics ⚖ 676 KB

An $O ( ( n\log p )^2 )$ Algorithm for t

✍ Chandrasekaran, R.; Tamir, A. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 776 KB

New heuristic algorithms for solving the

✍ Drezner, Zvi; Brimberg, Jack; Mladenović, Nenad; Salhi, Said 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 557 KB

HEURISTIC ALGORITHMS FOR SURVIVABLE P2P

✍ Walkowiak, Krzysztof; Przewoźniczek, Michał; Pająk, Krzysztof 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 641 KB