#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 dimpase):
Replying to [comment:14 ncohen]:
> By the way... I just retried to solve this problem using CPLEX instead
of Coin.. Result :
>
> {{{
> sage: time graphs.PetersenGraph().minor(graphs.CompleteGraph(5))
> Wall time: 0.22 s
> {0: [3, 8], 1: [5, 7], 2: [1, 2], 3: [0, 4], 4: [6, 9]}
> }}}
>
> {{{
> sage: time
graphs.PetersenGraph().minor(graphs.CompleteBipartiteGraph(3,3))
> Wall time: 0.18 s
> {0: [4, 9], 1: [5], 2: [1, 2], 3: [3, 8], 4: [0], 5: [7]}
> }}}
>
> So it seems it is not that bad after all :-)
I wonder how does it scale when the number of vertices of G grows.
Regarding CPLEX I would not be that optimistic - they did not say whether
they give that free licences for unlimited time.
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8404#comment:15>
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.
