[Haskell-cafe] Analysing Haskell with Graph Theory
ivan.miljenovic at gmail.com
Fri Mar 7 06:14:09 EST 2008
(CC'd to the list)
On 07/03/2008, Dusan Kolar <kolar at fit.vutbr.cz> wrote:
> I'm just wondering what algorithms you use for analysis. For instance,
> clique is an NP complete problem. Do you use some approximation? If yes,
> which? I'm particularly interested in the algorithm.
I haven't gotten that far yet ;-)
As it stands, my supervisor have discussed this slightly and I'll
probably start off with a more-or-less brute-force approach. This
should be OK as the graph will probably be reasonably sparse and
(hopefully) not too big!
Ivan Lazar Miljenovic
More information about the Haskell-Cafe