✦ LIBER ✦

Max-cut in circulant graphs

✍ Scribed by Svatopluk Poljak; Daniel Turzík

Book ID: 103061007
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 784 KB
Volume: 108
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90690-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

max-cut and containment relations in gra

max-cut and containment relations in graphs

✍ Marcin Kamiński 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 219 KB

An exact algorithm for MAX-CUT in sparse

An exact algorithm for MAX-CUT in sparse graphs

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

Resolvability in circulant graphs

✍ Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 248 KB

Weakly bipartite graphs and the Max-cut

Weakly bipartite graphs and the Max-cut problem

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

MAX-CUT has a randomized approximation s

MAX-CUT has a randomized approximation scheme in dense graphs

✍ W. Fernandez de la Vega 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 508 KB

A cut in a graph G = (V(G), E(G)) is the boundary 6(S) of some subset S V(G) and the maximum cut problem for G is to find the maximum number of edges in a cut. Let MC(G) denote this maximum. For any given 0 < a < 1, E > 0, and 17, we give a randomized algorithm which runs in a polynomial time and wh

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

MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

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