✦ LIBER ✦

Some New Matroids on Graphs: Cut Sets and the Max Cut Problem

✍ Scribed by Michele Conforti and M. R. Rao

Book ID: 118184899
Publisher: INFORMS
Year: 1987
Tongue: English
Weight: 494 KB
Volume: 12
Category: Article
ISSN: 0364-765X
DOI: 10.2307/3689684

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A probabilistic result for the max-cut p

A probabilistic result for the max-cut problem on random graphs

✍ Amir Beck; Marc Teboulle 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 101 KB

The max-cut problem on graphs not contra

The max-cut problem on graphs not contractible to K5

✍ Francisco Barahona 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 454 KB

An effective compact formulation of the

An effective compact formulation of the max cut problem on sparse graphs

✍ Giuseppe Lancia; Paolo Serafini 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 142 KB

The performance of an eigenvalue bound o

The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

✍ C. Delorme; S. Poljak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 683 KB

Delorme, C. and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Mathematics 111 (1993) 145-156. The authors earlier introduced a number q(C), which gives a well-computable upper bound on the maximum bipartite subgraph of a graph or, more

New algorithms for the weighted maximum

New algorithms for the weighted maximum cut problem on graphs

✍ N. Z. Shor; O. A. Berezovskii 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 360 KB