Cliquer - routines for clique searching. Cliquer is a set of C routines for finding cliques in an arbitrary weighted graph. It uses an exact branch-and-bound algorithm developed by Patric Östergård. It is designed with the aim of being efficient while still being flexible and easy to use. Cliquer was developed on Linux, and it should compile without modification on most modern UNIX systems. Other operating systems may require minor changes to the source code. (Source:

References in zbMATH (referenced in 65 articles )

Showing results 1 to 20 of 65.
Sorted by year (citations)

1 2 3 4 next

  1. Gezek, Mustafa; Mathon, Rudi; Tonchev, Vladimir D.: Maximal arcs, codes, and new links between projective planes of order 16 (2020)
  2. Lampio, Pekka H. J.; Östergård, Patric R. J.; Szöllősi, Ferenc: Orderly generation of Butson Hadamard matrices (2020)
  3. Szöllősi, Ferenc; Östergård, Patric R. J.: Constructions of maximum few-distance sets in Euclidean spaces (2020)
  4. Gezek, Mustafa; Tonchev, Vladimir D.; Wagner, Tim: Maximal arcs in projective planes of order 16 and related designs (2019)
  5. Heinlein, Daniel; Honold, Thomas; Kiermaier, Michael; Kurz, Sascha; Wassermann, Alfred: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (2019)
  6. Honold, Thomas; Kiermaier, Michael; Kurz, Sascha: Classification of large partial plane spreads in (\mathrmPG(6,2)) and related combinatorial objects (2019)
  7. Laaksonen, Antti; Östergård, Patric R. J.: New lower bounds on (q)-ary error-correcting codes (2019)
  8. Östergård, Patric R. J.: The sextuply shortened binary Golay code is optimal (2019)
  9. Östergård, Patric R. J.; Pöllänen, Antti: New results on tripod packings (2019)
  10. Zimmermann, Paul; Casamayou, Alexandre; Cohen, Nathann; Connan, Guillaume; Dumont, Thierry; Fousse, Laurent; Maltey, François; Meulien, Matthias; Mezzarobba, Marc; Pernet, Clément; Thiéry, Nicolas M.; Bray, Eric; Cremona, John; Forets, Marcelo; Ghitza, Alexandru; Thomas, Hugh: Computational mathematics with SageMath. Translated from the 2013 French original by the authors (2019)
  11. Azarija, Jernej; Marc, Tilen: There is no (75,32,10,16) strongly regular graph (2018)
  12. Braun, Michael; Östergård, Patric R. J.; Wassermann, Alfred: New lower bounds for binary constant-dimension subspace codes (2018)
  13. Kokkala, Janne I.; Östergård, Patric R. J.: The chromatic number of the square of the 8-cube (2018)
  14. Östergård, Patric R. J.; Soicher, Leonard H.: There is no McLaughlin geometry (2018)
  15. Araya, Makoto; Harada, Masaaki; Suda, Sho: Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach (2017)
  16. Crnković, Dean; Rodrigues, B. G.; Rukavina, Sanja; Tonchev, Vladimir D.: Quasi-symmetric (2)-((64, 24, 46)) designs derived from (\mathrmAG(3, 4)) (2017)
  17. Laaksonen, Antti; Östergård, Patric R. J.: Constructing error-correcting binary codes using transitive permutation groups (2017)
  18. Mathew, K. Ashik; Östergård, Patric R. J.: New lower bounds for the Shannon capacity of odd cycles (2017)
  19. Carraher, James M.; Galvin, David; Hartke, Stephen G.; Radcliffe, A. J.; Stolee, Derrick: On the independence ratio of distance graphs (2016)
  20. Honold, Thomas; Kiermaier, Michael; Kurz, Sascha: Constructions and bounds for mixed-dimension subspace codes (2016)

1 2 3 4 next