Solves the maximum independent set problem on the graph specified in the given file using branch
and bound with bounds coming from a boundary point method. 

mis_bpm <graph file> <size of largest known independent set> <fixed vertex file>


The graph file should be formatted as follows:

p edge <number of vertices> <number of edges>
e <node #> <node #>
e <node #> <node #>
...

the e lines specify bidirectional edges in the graph. 


The size of largest known independent set should be specified. The larger the better as this will
make the branch and bound tree much smaller. If -1 is given, the algorithm will terminate after
the first node in the branch and bound tree, weither solving the problem heuristically or bounding
once with the boundary point method. 