𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weakly bipartite graphs and the Max-cut problem

✍ Scribed by M. Grötschel; W.R. Pulleyblank

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
553 KB
Volume
1
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Autocorrelation coefficient for the grap
Autocorrelation coefficient for the graph bipartitioning problem
✍ E. Angel; V. Zissimopoulos 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 858 KB

Local search and its variants simulated annealing and tabu search are widely used heuristics to approximately solve NP-hard optimization problems. To use local search one "simply" has to specify a neighborhood structure and a cost function which has to be optimized. However, from a theoretical point

On the Ramsey Problem for Multicolor Bip
On the Ramsey Problem for Multicolor Bipartite Graphs
✍ W.A Carnielli; E.L Monte Carmelo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ž . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ž . Ä 4 words, if a G R m, n then every mat

An extremal bandwidth problem for bipart
An extremal bandwidth problem for bipartite graphs
✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views