Goto Chapter: Top 1 Bib Ind
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 

References

[DBJM+19] De Beule, J., Jonusas, J., Mitchell, J., Torpey, M. and Wilson, W., Digraphs, Graphs, digraphs, and multidigraphs in GAP, Version 0.15.2 (2019)
(GAP package), https://gap-packages.github.io/Digraphs.

[JK07] Junttila, T. and Kaski, P., Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs, in Proceedings of the Meeting on Algorithm Engineering & Expermiments, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2007), 135--149.

[MP14] McKay, B. D. and Piperno, A., Practical graph isomorphism, II, J. Symbolic Comput., 60 (2014), 94–112.

[Soi19] Soicher, L. H., GRAPE, GRaph Algorithms using PErmutation groups, Version 4.8.2 (2019)
(Refereed GAP package), https://gap-packages.github.io/grape.

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
Goto Chapter: Top 1 Bib Ind

generated by GAPDoc2HTML