✦ LIBER ✦

Counting and sampling minimum -cuts in weighted planar graphs in polynomial time

✍ Scribed by Ivona Bezáková; Adam J. Friedlander

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for minimum weight odd

✍ Adam N. Letchford; Nicholas A. Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Finding a Maximum Cut of a Planar Graph

✍ Hadlock, F. 📂 Article 📅 1975 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 459 KB

Computing and Counting Longest Paths on

✍ George B. Mertzios; Ivona Bezáková 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Comments on F. Hadlock’s Paper: “Finding

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