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 57 articles )

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

1 2 3 next

  1. 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)
  2. Honold, Thomas; Kiermaier, Michael; Kurz, Sascha: Classification of large partial plane spreads in (\mathrmPG(6,2)) and related combinatorial objects (2019)
  3. Östergård, Patric R. J.: The sextuply shortened binary Golay code is optimal (2019)
  4. Östergård, Patric R. J.; Pöllänen, Antti: New results on tripod packings (2019)
  5. Azarija, Jernej; Marc, Tilen: There is no (75,32,10,16) strongly regular graph (2018)
  6. Braun, Michael; Östergård, Patric R. J.; Wassermann, Alfred: New lower bounds for binary constant-dimension subspace codes (2018)
  7. Kokkala, Janne I.; Östergård, Patric R. J.: The chromatic number of the square of the 8-cube (2018)
  8. Östergård, Patric R. J.; Soicher, Leonard H.: There is no McLaughlin geometry (2018)
  9. Araya, Makoto; Harada, Masaaki; Suda, Sho: Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach (2017)
  10. Crnković, Dean; Rodrigues, B. G.; Rukavina, Sanja; Tonchev, Vladimir D.: Quasi-symmetric (2)-((64, 24, 46)) designs derived from (\mathrmAG(3, 4)) (2017)
  11. Laaksonen, Antti; Östergård, Patric R. J.: Constructing error-correcting binary codes using transitive permutation groups (2017)
  12. Mathew, K. Ashik; Östergård, Patric R. J.: New lower bounds for the Shannon capacity of odd cycles (2017)
  13. Carraher, James M.; Galvin, David; Hartke, Stephen G.; Radcliffe, A. J.; Stolee, Derrick: On the independence ratio of distance graphs (2016)
  14. Honold, Thomas; Kiermaier, Michael; Kurz, Sascha: Constructions and bounds for mixed-dimension subspace codes (2016)
  15. Kokkala, Janne I.; Östergård, Patric R. J.: Further results on the classification of MDS codes (2016)
  16. Oliveira, Lucas de; de Souza, Cid C.; Yunes, Tallys: Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (2016)
  17. Xu, Hong; Kumar, T. K. Satish; Koenig, Sven: A new solver for the minimum weighted vertex cover problem (2016)
  18. Chee, Yeow Meng; Colbourn, Charles J.; Ling, Alan Chi Hung; Zhang, Hui; Zhang, Xiande: Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses (2015)
  19. Ćustić, Ante; Krčadinac, Vedran; Zhou, Yue: Tiling groups with difference sets (2015)
  20. Kokkala, Janne I.; Östergård, Patric R. J.: Classification of Graeco-Latin cubes (2015)

1 2 3 next