On Hackage there is the Graphalyze package but it doesn't seem to do vertex coloring. Are you talking about undirected graphs? On Sat, Jul 14, 2012 at 12:23 PM, Alec Story wrote:

I'd prefer an exact solution, but it doesn't have to be particularly performant (this is research code).

The graphs are pretty small in general, all my test cases will have < 10 nodes, but have high connectivity. They don't have any special properties. On Jul 14, 2012 2:50 PM, "KC" wrote:

...

Are you looking for an exact or approximate solution.

How many nodes and edges?

Any special properties that the graph has?

On Fri, Jul 13, 2012 at 1:43 PM, Alec Story wrote:

...

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'm not particularly concerned about speed, and it's unlikely that I'll generate really bad edge cases, but I'd prefer to do something other than write the really bad try-every-case algorithm.

-- Alec Story Cornell University Biological Sciences, Computer Science 2012

_______________________________________________ Beginners mailing list Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners

-- -- Regards, KC

-- -- Regards, KC