[Lemon-user] K-partite matching

[Balázs Dezső]

>      I have a problem which can be modelled as weighted k-partite
> maximum matching problem. I am wondering if there are k-partite graph
> and matching algorithm in lemon graph library.
Is this question about hypergraph matching? If yes, unfortunately,
there is no such algorithm in LEMON. There are only graph (edges/arcs
with two end-points) data structures, and matchings for these graphs.

Balazs


On Wed, Aug 22, 2012 at 10:18 AM, Jialu Hu <hujialu.xd at gmail.com> wrote:
> Hello,
>
>      I have a problem which can be modelled as weighted k-partite
> maximum matching problem. I am wondering if there are k-partite graph
> and matching algorithm in lemon graph library.
>
> All the best,
> Jialu
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user