✦ LIBER ✦

Finding a Maximum Cut of a Planar Graph in Polynomial Time

✍ Scribed by Hadlock, F.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on F. Hadlock’s Paper: “Finding

✍ Aoshima, K.; Iri, M. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB

Counting and sampling minimum -cuts in w

✍ Ivona Bezáková; Adam J. Friedlander 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 366 KB

Finding a maximum matching in a permutat

✍ Chongkye Rhee, Y. Daniel Liang 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 723 KB

NP-completeness of maximum-cut and cycle

✍ A. P. Terebenkov 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 462 KB

Finding a maximum matching in a circular

✍ Y.Daniel Liang; Chongkye Rhee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Finding a maximum independent set in a p

✍ Haklin Kim 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 374 KB