#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 dcoudert):
You can use the k-core of G instead, with k=min(H.degree()). So the pre-
processing could be like:
{{{
k = min(H.degree())
if k>min(G.degree()):
cores = G.cores(with_labels=True)
G2 = G.subgraph([u for u in cores if cores[u]>=k])
else:
G2 = G
return G2.subgraph_search(H)
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/15632#comment:1>
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.
