#15181: Treewidth (lazy implementation)
-----------------------------+---------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.12
Component: PLEASE CHANGE | Keywords:
Merged in: | Authors: Nathann Cohen
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+---------------------------------
This code is a veeeery lazy implementation of a very lazy algorithm to
compute the treewidth of a graph. It can be greatly improved in at least
two places.
If it is to be improved later, this implementation will probably remain
useful anyway, as we try to always keep many of them alive, just to check
whether they all return sound results. Hence it's not so bad if it is a
bit wasteful `:-P`
And well. It's great to have this, too `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15181>
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/groups/opt_out.
