#17132: Perfect Matchings for Graphs
-------------------------------------+-------------------------------------
Reporter: ayyer | Owner:
Type: task | Status: new
Priority: minor | Milestone: sage-6.4
Component: graph theory | Keywords: perfect
Merged in: 6.3 | matchings, graphs
Reviewers: | Authors: Arvind Ayyer
Work issues: | Report Upstream: N/A
Commit: | Branch:
18d641858474d73a3e7dd3e5c02e2baecca2aa14| public/ayyer/perfect_matchings
Stopgaps: | Dependencies:
-------------------------------------+-------------------------------------
I would like to implement and use an efficient program for the calculation
of perfect matchings (aka 1-factors) of graphs. I know that a class called
{{{PerfectMatchings}}} has been created, but there does not seem to be any
program there to compute perfect matchings of graphs. There also seem to
be programs for computing matching polynomials of graphs, but the
algorithms for it are very different.
I have written a simple program using induction, but I'm not sure where it
should be placed (ie. combinat/ or graphs/). For now, I have placed the
file "perfect_matchings.py" in the graphs/ directory, but we can move it
somewhere else if needed.
I need help with certain things since I am new to this.
1. Proper formatting, of course. (I can work on this by looking at other
files, but I'll need some supervision.)
2. How do I make sure that tab-completion works? That is, if {{{G}}} is a
graph, {{{G.perf<tab>}}} should auto-fill it?
3. Is it worth treating the output as a member of the
{{{PerfectMatchings}}} class?
--
Ticket URL: <http://trac.sagemath.org/ticket/17132>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
