On Hackage there is the Graphalyze package but it doesn&#39;t seem to do vertex coloring.<div><br></div><div>Are you talking about undirected graphs?</div><div><br></div><div><br></div><div><div class="gmail_quote">On Sat, Jul 14, 2012 at 12:23 PM, Alec Story <span dir="ltr">&lt;<a href="mailto:avs38@cornell.edu" target="_blank">avs38@cornell.edu</a>&gt;</span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><p>I&#39;d prefer an exact solution, but it doesn&#39;t have to be particularly performant (this is research code).</p>

<p>The graphs are pretty small in general, all my test cases will have &lt; 10 nodes, but have high connectivity.  They don&#39;t have any special properties.</p><div class="HOEnZb"><div class="h5">
<div class="gmail_quote">On Jul 14, 2012 2:50 PM, &quot;KC&quot; &lt;<a href="mailto:kc1956@gmail.com" target="_blank">kc1956@gmail.com</a>&gt; wrote:<br type="attribution"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">

Are you looking for an exact or approximate solution.<div><br></div><div>How many nodes and edges?</div><div><br></div><div>Any special properties that the graph has?</div><div><br><br><div class="gmail_quote">On Fri, Jul 13, 2012 at 1:43 PM, Alec Story <span dir="ltr">&lt;<a href="mailto:avs38@cornell.edu" target="_blank">avs38@cornell.edu</a>&gt;</span> wrote:<br>


<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">I have a problem where I need to find the smallest k-coloring for a graph that represents conflicts between objects.  Is there a Haskell library that will do this for me?  I&#39;m not particularly concerned about speed, and it&#39;s unlikely that I&#39;ll generate really bad edge cases, but I&#39;d prefer to do something other than write the really bad try-every-case algorithm.<span><font color="#888888"><br clear="all">




<br>-- <br>Alec Story<br>Cornell University<br>Biological Sciences, Computer Science 2012<br>
</font></span><br>_______________________________________________<br>
Beginners mailing list<br>
<a href="mailto:Beginners@haskell.org" target="_blank">Beginners@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/beginners" target="_blank">http://www.haskell.org/mailman/listinfo/beginners</a><br>
<br></blockquote></div><br><br clear="all"><div><br></div>-- <br>--<br>Regards,<br>KC<br>
</div>
</blockquote></div>
</div></div></blockquote></div><br><br clear="all"><div><br></div>-- <br>--<br>Regards,<br>KC<br>
</div>