#8404: Computing a H-minor
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by dimpase):
* status: needs_review => needs_work
Comment:
Replying to [comment:7 wdj]:
> Nathann: Please do write up the paper Jason suggests. I would also be
very interested.
Nathann, you seem to be systematically writing LP where it should be ILP,
or MILP, right?
Please fix this.
As well, you need to include meaningful examples: e.g. showing how to use
your code to show that some well-known graph (say, Petersen) is not planar
by finding a Kuratowski minor. It's not obvious that your code can handle
this in reasonable time (I have had my share of using ILP for seemingly
small problems, with very limited success).
And, apart from planarity (planarity is easy algorithmically, so it has
only theoretical interest here), few other real problems involving graph
minors.
And if the code cannot do anything useful, it should not be included in
Sage (not in the standard or optional part, anyway)
I therefore change the status to "needs work"... (I wish we had anonymous
reviewing, like in journals :-))
Dmitrii
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8404#comment:10>
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.
