title: Java library for a clique cover of a graph
body: <p>Does anyone know of a library or some code (preferably Java) that solves the clique cover problem?</p>
  
  <p>I found an OCaml <a href="http://theinf1.informatik.uni-jena.de/ecc/README" rel="nofollow">version</a>, but I would like to use something I can more easily integrate with.</p>
  
  <p>I've also found Java <a href="http://jgrapht.org/javadoc/org/jgrapht/alg/BronKerboschCliqueFinder.html" rel="nofollow">code</a> and C code to find the maximum clique in a graph, but I don't know of a way to leverage this code to find a clique cover (e.g., iteratively removing maximum cliques until no nodes are left does not yield an optimum solution).</p>