#10482: Add Weisfeiler-Leman algorithm to sage.graphs
-------------------------------------------------+-------------------------
Reporter: kini | Owner: kini
Type: enhancement | Status:
Priority: major | needs_work
Component: graph theory | Milestone:
Keywords: weisfeiler-leman algorithm, | sage-5.11
graphs, coherent configurations, refinement | Resolution:
Authors: Keshav Kini | Merged in:
Report Upstream: N/A | Reviewers:
Branch: | Work issues:
Stopgaps: | Dependencies:
-------------------------------------------------+-------------------------
Comment (by dimpase):
an optimal canonical labellling algorithm is described here:
http://www.automata.rwth-aachen.de/~grohe/pub/berbongro13.pdf
It runs in O((n+m)log n) time, with n, resp. m, being #of vertices (resp.
edges).
--
Ticket URL: <http://trac.sagemath.org/ticket/10482#comment:9>
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.
