#8404: Computing a H-minor
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by ncohen):
Not really... The only way for me to use LP is through Sage, so most of
what I write ends up as a patch. I recently sent a patch for two
variations of graph coloring that interest me #8405.
Actually, my recent patches of LP formulations :
* #2203 Traveling Salesman Problem
* #7476 Edge-disjoint spanning trees
* #7529 Maximum average Degree
* #8403 Steiner Tree
* #8405 Linear arboricity / Acyclic edge coloring
* This very patch
All have the same thing in common : there is an easy way that I ignored
until very recently to write "acyclicity" without using column generation.
It may be a bit slower, but I do not have to write column generation to
define them, at least :p
Knowing how to say "acyclicity" enables one to say "connectedness". And
once you know how to say "connectedness", you can say Minor, Steiner Tree,
TSP, etc :-)
What would you like to find in such a document ? A list of formulations,
plus explanations ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8404#comment:5>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
