Description: This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2
the graph is implemented using an adjacent matrix, the nodes are chosen randomaly
k = the number of bits for represntation
n = 2^k -1
The pair wise method implement as a matrix , using a XOR command,
the columns in the matrix represent all of the sub -groups in a pair wise way
Good luck
Shahar
To Search:
File list (Check if you may need any files):
MaxCut\.classpath
......\.project
......\.settings\org.eclipse.jdt.core.prefs
......\bin\main.class
......\src\main.java
......\.settings
......\bin
......\src
MaxCut
Download