Abstract
The goal of maximum cut problem is to partition the vertex set of an undirected graph into two parts in order to maximize the cardinality of the set of edges cut by the partition. Enlightened by the elastic net method that was introduced by Durbin and Willshaw for finding shortest route for the Traveling Salesman Problem (TSP), we propose a new parallel algorithm for the maximum cut problem. A large number of instances are simulated to verify the proposed algorithm. The effectiveness of the proposed algorithm is confirmed by the simulation results. © Springer-Verlag 2004.
Cite
CITATION STYLE
Xia, G., Tang, Z., Wang, J., Wang, R., Li, Y., & Xia, G. (2004). A new parallel improvement algorithm for maximum cut problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3173, 419–424. https://doi.org/10.1007/978-3-540-28647-9_70
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
