Goto Chapter: Top 1 2 3 4 5 6 7 8 Bib Ind
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 

References

[BJM+21] Beule, J. D., Jonušas, J., Mitchell, J. D., Torpey, M., Tsalakou, M. and Wilson, W. A., Digraphs -- GAP package, Version 1.5.0 (2021).

[GAP21] GAP -- Groups, Algorithms, and Programming, Version 4.11.1, The GAP Group (2021).

[Jef20] Jefferson, C., json -- GAP package, Version 2.0.2 (2020).

[Jef21] Jefferson, C., ferret -- GAP package, Version 1.0.6 (2021).

[JHPL21] Jefferson, C., Horn, M., Pfeiffer, M. and Linton, S., datastructures -- GAP package, Version 0.2.6 (2021).

[JJPW19] Jefferson, C., Jonauskyte, E., Pfeiffer, M. and Waldecker, R., Minimal and canonical images, J. Algebra, 521 (2019), 481--506.

[JJPW21] Jefferson, C., Jonauskyte, E., Pfeiffer, M. and Waldecker, R., images -- GAP package, Version 1.3.1 (2021).

[JK07] Junttila, T. and Kaski, P., Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs, 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), Society for Industrial and Applied Mathematics (2007), 135--149.

[JPW19] Jefferson, C., Pfeiffer, M. and Waldecker, R., New refiners for permutation group search, J. Symbolic Comput., 92 (2019), 70--92.

[JPWW19] Jefferson, C., Pfeiffer, M., Waldecker, R. and Wilson, W. A., Permutation group algorithms based on directed graphs (extended version), manuscript (2019).

[JPWW21] Jefferson, C., Pfeiffer, M., Waldecker, R. and Wilson, W. A., Permutation group algorithms based on directed graphs, J. Algebra, 585 (2021), 723--758.

[JW21a] Jefferson, C. and Wilson, W. A., BacktrackKit -- GAP package, Version 0.6.0 (2021).

[JW21b] Jefferson, C. and Wilson, W. A., GraphBacktracking -- GAP package, Version 0.5.1 (2021).

[Leo91] Leon, J. S., Permutation group algorithms based on partitions. I. Theory and algorithms, J. Symbolic Comput., 12 (4-5) (1991), 533--583.

[Leo97] Leon, J. S., Partitions, refinements, and permutation group computation, in Groups and computation, II (New Brunswick, NJ, 1995), Amer. Math. Soc., Providence, RI, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 28 (1997), 123--158.

[Lin04] Linton, S., Finding the smallest image of a set, in Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation (2004), 229--234.

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

[Neu21] Neunhöffer, M., IO -- GAP package, Version 4.7.2 (2021).

[Soi21] Soicher, L. H., GRAPE -- GAP package, Version 4.8.5 (2021).

[The97] Theißen, H., Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen, Verlag der Augustinus-Buchh. (1997).

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
Goto Chapter: Top 1 2 3 4 5 6 7 8 Bib Ind

generated by GAPDoc2HTML