#15632: improving subgraph search
--------------------------------+------------------------
Reporter: azi | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.1
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+------------------------
Comment (by azi):
Replying to [comment:6 ncohen]:
> Yoooooo !
>
> > Now you can tell me if you wish we include this preprocesing thing or
you see a better way to improve subgraph search altogether?
>
> Well, it would definitely be cool to have this available through a flag
in `subgraph_search*`. Do you think it should be the default behaviour ?
The answer to this most likely depends on the average structure of input
graphs which we do not know anything about. Hence its definitely something
that the user should know. So yeah, a preprocessing flag looks like a good
option, though I am not sure we lose that much performance by always doing
the preprocesing phase.
> Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15632#comment:8>
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.
