[Lemon-user] Enumerate all maximal/perfect matchings?

[atsuiai at aim.com]

Hello All,

   I've been using Lemon for some time now for finding maximal matchings, and am happy to see the August update!

   There's a particular problem I've been working on, and I don't know if I can solve it using Lemon or not. So, I have a general graph that is connected, and I'd like to enumerate over all perfect or maximal matchings (either is fine). The graph has a limitation that each node must have 1 or 2 or 3 neighbors (just 2 or 3 neighbors works as well).

    Note, my true goal is to find the average value that an edge is matched out of all possible configurations. So if an edge is never matched, it will have a value of 0, matched in a quater of the matchings, 0.25, etc. I do not know of a method other than enumerating all matchings to find this number.

   If Lemon is capable of this, please let me know! I've read over the documentation for the matching algorithms, and I didn't iinterpret anything that could be a solution. If there is even a method outside of lemon, I'd like to hear it! 

   Thanks for your time,

    Atsui
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20130912/4e47d78e/attachment.html>