A Rainbow Clique Search Algorithm for BLT-Sets
- 727 Downloads
We discuss an algorithm to search for rainbow cliques in vertex-colored graphs. This algorithm is a generalization of the Bron-Kerbosch algorithm to search for maximal cliques in graphs. As an application, we describe a larger algorithm to classify a certain type of geometric-combinatorial objects called BLT-sets. We report on the classification of BLT-sets of order 71.
KeywordsClassification Rainbow clique Graph BLT-set Finite geometry
The authors acknowledge generous access to the HPC resource Summit , which was essential to perform the computations necessary for this work.
- 1.Anderson, J., Burns, P.J., Milroy, D., Ruprecht, P., Hauser, T., Siegel, H.J.: Deploying RMACCS summit: an HPC resource for the rocky mountain region. In: Proceedings of PEARC 2017, New Orleans, LA, USA, 09–13 July 2017, 7 pages (2017)Google Scholar
- 4.Betten, A.: Orbiter - a program to classify discrete objects (2016). https://github.com/abetten/orbiter
- 5.Betten, A.: How fast can we compute orbits of groups? In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 62–70. Springer, Cham (2018)Google Scholar
- 6.Betten, A.: Rainbow cliques and the classification of small BLT-sets. In: ISSAC 2013–Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pp. 53–60. ACM, New York (2013)Google Scholar
- 9.Law, M.: Flocks, generalised quadrangles and translation planes from BLT-sets. Thesis presented to the Department of Mathematics and Statistics, The University of Western Australia, March 2003Google Scholar
- 10.Law, M., Penttila, T.: Classification of flocks of the quadratic cone over fields of order at most 29. Adv. Geom. (suppl.), S232–S244 (2003)Google Scholar
- 11.Magma: The Computational Algebra Group within the School of Mathematics and Statistics of the University of Sydney (2004)Google Scholar