✦ LIBER ✦

max-cut and containment relations in graphs

✍ Scribed by Marcin Kamiński

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Containment relations in split graphs

✍ Petr A. Golovach; Marcin Kamiński; Daniël Paulusma; Dimitrios M. Thilikos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Max-cut in circulant graphs

✍ Svatopluk Poljak; Daniel Turzík 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Weakly bipartite graphs and the Max-cut

✍ M. Grötschel; W.R. Pulleyblank 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 553 KB

MAX-CUT and MAX-BISECTION are NP-hard on

✍ Josep Díaz; Marcin Kamiński 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Some New Matroids on Graphs: Cut Sets an

✍ Michele Conforti and M. R. Rao 📂 Article 📅 1987 🏛 INFORMS 🌐 English ⚖ 494 KB

An exact algorithm for MAX-CUT in sparse

✍ F. Della Croce; M.J. Kaminski; V.Th. Paschos 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 148 KB