✦ LIBER ✦

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

✍ Scribed by Takefuji, Y.; Lee, K.C.; Cho, Y.B.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On O(p2) algorithms for planarization

✍ Carson, D.I. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 297 KB

An O(N2) algorithm for coloring perfect

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

Comments on "An O(n/sup 2.5/) fault iden

✍ Radoytchevsky, V.T.; Shalaev, A.J. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 199 KB

An $O(n^2 )$ Algorithm for Coloring Prop

✍ Orlin, James B.; Bonuccelli, Maurizio A.; Bovet, Daniel P. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics ⚖ 634 KB

An O(log n)-Approximation Algorithm for

✍ Kawarabayashi, Ken-Ichi; Kobayashi, Yusuke 📂 Article 📅 2013 🏛 Association for Computing Machinery 🌐 English ⚖ 557 KB

Solving maximum clique in sparse graphs:

✍ Buchanan, Austin; Walteros, Jose L.; Butenko, Sergiy; Pardalos, Panos M. 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 188 KB