1DSDP-MAXCUT(1)                   User Commands                  DSDP-MAXCUT(1)
2
3
4

NAME

6       dsdp-maxcut - Find an approximate maximum cut of a graph
7

SYNOPSIS

9       dsdp-maxcut GRAPH_FILE
10

DESCRIPTION

12       The  dsdp-maxcut  program reads a graph from a file, formulates the SDP
13       relaxation of the maximum cut problem, solves  the  problem  using  the
14       DSDP library, and applies a randomized algorithm to generate an approx‐
15       imate solution.
16

FILE FORMAT

18       The input file should be in the following format:
19              n m
20              r1 c1 [w1]
21              …
22              im jm [wm]
23       where n is the number of nodes, and m is the number of edges.  Each r/c
24       pair  or  r/c/w triple describes one edge, where r is the row, c is the
25       column, and w is the weight.  The weight defaults to 0.0.
26

SEE ALSO

28       dsdp-color(1), dsdp5(1), dsdp-stable(1), dsdp-theta(1)
29
30
31
32DSDP                                  5.8                       DSDP-MAXCUT(1)