#8403: Steiner Tree
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.4.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by rlm):
Replying to [comment:5 ncohen]:
> And you are right. I was thinking about spanning trees, as I usually do
not care about weights...
I don't think spanning tree is linear: the standard method is a BFS/DFS,
which is still worst case quadratic. I know this is no longer relevant
here, but I want to make sure I have this right. If you do know of a
linear time spanning tree algorithm, I'm curious about it.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8403#comment:7>
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.
