Hello, My name is Jody Leonard, and I am currently a fourth year undergraduate studying Mathematics and Computer Science. Some of my interests (stemming from both from general coursework and from a senior project this year) are in combinatorics and graph theory, and I would be interested in looking at ways of combining those interests with work on an open source project.
Looking through some SAGE related links on graphs (http://www.sagemath.org/doc/reference/graphs/), it seems that while SAGE supports matching polynomials, it does not seem to currently support any other graph matching-related routines - for example, methods for finding perfect matchings, maximum weight matchings, etc. I have some experience working with approaches to these types of problems (eg., the Hungarian algorithm for Bipartite graphs, Edmond's algorithm for general graphs), and would like to propose implementing these approaches in SAGE as a possible GSOC activity. Would something like this be of interest and feasible? I would appreciate any suggestions on how to extend this idea also, since I recognize that what I've given may only be the start of a proposal. For reference, I have a decent amount of experience with Python and with NetworkX (which seems to be one of the ways that SAGE approaches graphs). Thanks, Jody -- You received this message because you are subscribed to the Google Groups "sage-gsoc" 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-gsoc. For more options, visit https://groups.google.com/d/optout.
