From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by yquem.inria.fr (Postfix) with ESMTP id 65C23BBAF for ; Tue, 1 Jun 2010 18:21:10 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AkQBAIbQBEzRVdY2mGdsb2JhbACRd4w0CBUBAQEBAQgJDAcRIrIJggKFPC6ITwEBAwWFEQSDQw X-IronPort-AV: E=Sophos;i="4.53,341,1272837600"; d="scan'208";a="51581236" Received: from mail-bw0-f54.google.com ([209.85.214.54]) by mail3-smtp-sop.national.inria.fr with ESMTP; 01 Jun 2010 18:21:07 +0200 Received: by bwz2 with SMTP id 2so50261bwz.27 for ; Tue, 01 Jun 2010 09:21:07 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:received:received:in-reply-to :references:date:message-id:subject:from:to:cc:content-type; bh=NvwoSBgvmwTwsJi8QS+afXO6LrqwBysqLehS7ZIWQR4=; b=CCyWZxPm0VRkMwTbrxyXmc0gQxbzi4jgBeSG0yrIK99OVlx6XC0Sfro6ful5aDwqvl QoP658x6wtKkp6lctawK0sKwVrJE4S4dGkMbQsaWov8fw7l0MQh74G3zLljezmoA71+8 uZy08DGxtDZ0I6zAJBaRU6asa6ahTHnSlk29s= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type; b=kzzOzpGn6OqEeWdALXwK9AtijEv/wc+9q6CLpj8FnNBfntwJs/qMkAtz/VXCmv57oS 3o8rV+oh5EEsCMmK9THEu4OWt7xviSYdlvlcLp+lANKXiLBDRpnvs0uIZeUoJ+S4rrib B9OKYmBFRTawNdThiJVQtNqMdr6I3a59Lo2xY= MIME-Version: 1.0 Received: by 10.204.81.77 with SMTP id w13mr817357bkk.38.1275409267161; Tue, 01 Jun 2010 09:21:07 -0700 (PDT) Received: by 10.204.127.74 with HTTP; Tue, 1 Jun 2010 09:21:07 -0700 (PDT) In-Reply-To: <20100601145634.GA24691@uranium.pps.jussieu.fr> References: <20100601145634.GA24691@uranium.pps.jussieu.fr> Date: Tue, 1 Jun 2010 19:21:07 +0300 Message-ID: Subject: Re: [Caml-list] hypergraph partitioning algorithm ? From: Eray Ozkural To: Pietro Abate Cc: caml-list@inria.fr Content-Type: text/plain; charset=ISO-8859-1 X-Spam: no; 0.00; partitioning:01 eray:01 ozkural:01 cheers:01 partitioning:01 ocaml:01 ocaml:01 afaik:01 wikipedia:01 wiki:01 beginner's:01 bug:01 eray:01 ozkural:01 bilkent:01 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 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