The csdp-theta program uses the CSDP library to compute the Lovasz Theta number of an input graph.
The input file should be in the following format:
where n is the number of nodes, m is the number of edges, and each i/j pair describes one edge.
The output is the Lovasz Theta number of the input graph. The exit status is zero if the number is computed successfully. Otherwise, the exit status is one, and an error message indicating the problem is produced on standard out.
Csdp was written by Dr. Brian Borchers <firstname.lastname@example.org>, with contributions by Joseph Young <email@example.com> and Aaron Wilson <firstname.lastname@example.org>.
This man page was written by Jerry James <email@example.com>. It is distributed under the same terms as Csdp.
csdp-graphtoprob(1), csdp-complement(1), csdp-rand_graph(1)
csdp-complement(1), csdp-graphtoprob(1), csdp-rand_graph(1).