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

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