Your company here, and a link to your site. Click to find out more.

dsdp-maxcut - Man Page

Find an approximate maximum cut of a graph


dsdp-maxcut GRAPH_FILE


The dsdp-maxcut program reads a graph from a file, formulates the SDP relaxation of the maximum cut problem, solves the problem using the DSDP library, and applies a randomized algorithm to generate an approximate solution.

File Format

The input file should be in the following format:

n m
r1 c1 [w1]

im jm [wm]

where n is the number of nodes, and m is the number of edges.  Each r/c pair or r/c/w triple describes one edge, where r is the row, c is the column, and w is the weight.  The weight defaults to 0.0.

See Also

dsdp-color(1), dsdp5(1), dsdp-stable(1), dsdp-theta(1)

Referenced By

dsdp5(1), dsdp-color(1), dsdp-stable(1), dsdp-theta(1).

5.8 DSDP