  
  
  [1XReferences[101X
  
  [[20XBJM+21[120X]  [16XBeule,  J. D., Jonušas, J., Mitchell, J. D., Torpey, M., Tsalakou,
  M. and Wilson, W. A.[116X, [17XDigraphs -- GAP package, Version 1.5.0[117X (2021).
  
  [[20XGAP21[120X]  [17XGAP -- Groups, Algorithms, and Programming, Version 4.11.1[117X, The GAP
  Group (2021).
  
  [[20XJef20[120X] [16XJefferson, C.[116X, [17Xjson -- GAP package, Version 2.0.2[117X (2020).
  
  [[20XJef21[120X] [16XJefferson, C.[116X, [17Xferret -- GAP package, Version 1.0.6[117X (2021).
  
  [[20XJHPL21[120X]   [16XJefferson,   C.,   Horn,   M.,   Pfeiffer,  M.  and  Linton,  S.[116X,
  [17Xdatastructures -- GAP package, Version 0.2.6[117X (2021).
  
  [[20XJJPW19[120X]  [16XJefferson,  C.,  Jonauskyte,  E.,  Pfeiffer, M. and Waldecker, R.[116X,
  [17XMinimal   and   canonical   images[117X,   [18XJ.   Algebra[118X,   [19X521[119X  (2019),  481--506
  (https://doi.org/10.1016/j.jalgebra.2018.11.009).
  
  [[20XJJPW21[120X]  [16XJefferson,  C.,  Jonauskyte,  E.,  Pfeiffer, M. and Waldecker, R.[116X,
  [17Ximages -- GAP package, Version 1.3.1[117X (2021).
  
  [[20XJK07[120X]  [16XJunttila,  T.  and  Kaski,  P.[116X,  [17XEngineering  an Efficient Canonical
  Labeling  Tool  for  Large  and Sparse Graphs[117X, [18X2007 Proceedings of the Ninth
  Workshop  on  Algorithm  Engineering  and  Experiments (ALENEX)[118X, Society for
  Industrial      and      Applied      Mathematics      (2007),      135--149
  (https://doi.org/10.1137/1.9781611972870.13).
  
  [[20XJPW19[120X]  [16XJefferson,  C.,  Pfeiffer,  M.  and Waldecker, R.[116X, [17XNew refiners for
  permutation   group   search[117X,   [18XJ.   Symbolic  Comput.[118X,  [19X92[119X  (2019),  70--92
  (https://doi.org/10.1016/j.jsc.2017.12.003).
  
  [[20XJPWW19[120X]  [16XJefferson,  C.,  Pfeiffer,  M.,  Waldecker,  R. and Wilson, W. A.[116X,
  [17XPermutation  group  algorithms  based on directed graphs (extended version)[117X,
  [18Xmanuscript[118X (2019).
  
  [[20XJPWW21[120X]  [16XJefferson,  C.,  Pfeiffer,  M.,  Waldecker,  R. and Wilson, W. A.[116X,
  [17XPermutation  group  algorithms  based  on  directed  graphs[117X, [18XJ. Algebra[118X, [19X585[119X
  (2021), 723--758 (https://doi.org/10.1016/j.jalgebra.2021.06.015).
  
  [[20XJW21a[120X]  [16XJefferson,  C.  and  Wilson,  W.  A.[116X,  [17XBacktrackKit -- GAP package,
  Version 0.6.0[117X (2021).
  
  [[20XJW21b[120X]  [16XJefferson,  C. and Wilson, W. A.[116X, [17XGraphBacktracking -- GAP package,
  Version 0.5.1[117X (2021).
  
  [[20XLeo91[120X]  [16XLeon,  J.  S.[116X, [17XPermutation group algorithms based on partitions. I.
  Theory and algorithms[117X, [18XJ. Symbolic Comput.[118X, [19X12[119X, 4-5 (1991), 533--583.
  
  [[20XLeo97[120X]   [16XLeon,  J.  S.[116X,  [17XPartitions,  refinements,  and  permutation  group
  computation[117X,  in Groups and computation, II (New Brunswick, NJ, 1995), Amer.
  Math.  Soc.,  Providence,  RI,  DIMACS  Ser. Discrete Math. Theoret. Comput.
  Sci., [19X28[119X (1997), 123--158.
  
  [[20XLin04[120X]  [16XLinton,  S.[116X, [17XFinding the smallest image of a set[117X, in Proceedings of
  the  2004  International  Symposium  on  Symbolic  and Algebraic Computation
  (2004), 229--234.
  
  [[20XMP14[120X]  [16XMcKay,  B.  D.  and Piperno, A.[116X, [17XPractical graph isomorphism, II[117X, [18XJ.
  Symbolic           Comput.[118X,           [19X60[119X           (2014),           94--112
  (https://doi.org/10.1016/j.jsc.2013.09.003).
  
  [[20XNeu21[120X] [16XNeunhöffer, M.[116X, [17XIO -- GAP package, Version 4.7.2[117X (2021).
  
  [[20XSoi21[120X] [16XSoicher, L. H.[116X, [17XGRAPE -- GAP package, Version 4.8.5[117X (2021).
  
  [[20XThe97[120X]   [16XTheißen,   H.[116X,   [17XEine   Methode   zur   Normalisatorberechnung  in
  Permutationsgruppen  mit Anwendungen in der Konstruktion primitiver Gruppen[117X,
  Verlag der Augustinus-Buchh. (1997).
  
  
  
  [32X
