Version française
Home     About     Download     Resources     Contact us    
Browse thread
hypergraph partitioning algorithm ?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Eray Ozkural <examachine@g...>
Subject: Re: [Caml-list] hypergraph partitioning algorithm ?
Hi there,

Those are not very often implemented, and no there is none that I can
think of, at least freely so. However, I was actually planning on
implementing one, adapting some of our efficient algorithms.

Cheers,

On Tue, Jun 1, 2010 at 5:56 PM, Pietro Abate
<Pietro.Abate@pps.jussieu.fr> wrote:
> Hello,
>
> Do you know of any implementation of the Fiduccia-Mattheyses algorithm
> or other hypergraph partitioning / clustering algorithms in ocaml ?
>
> There are two c++ libraries (GTL and scotch) that implement these
> algorithms, but no binding to ocaml afaik...
>
> thanks !
> p
>
> --
> ----
> http://en.wikipedia.org/wiki/Posting_style
>
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
>



-- 
Eray Ozkural, PhD candidate.  Comp. Sci. Dept., Bilkent University, Ankara
http://groups.yahoo.com/group/ai-philosophy
http://myspace.com/arizanesil http://myspace.com/malfunct