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

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

1 2 next

  1. Araya, Makoto; Harada, Masaaki; Suda, Sho: Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach (2017)
  2. Carraher, James M.; Galvin, David; Hartke, Stephen G.; Radcliffe, A.J.; Stolee, Derrick: On the independence ratio of distance graphs (2016)
  3. Honold, Thomas; Kiermaier, Michael; Kurz, Sascha: Constructions and bounds for mixed-dimension subspace codes (2016)
  4. Kokkala, Janne I.; Östergård, Patric R.J.: Further results on the classification of MDS codes (2016)
  5. 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)
  6. Ćustić, Ante; Krčadinac, Vedran; Zhou, Yue: Tiling groups with difference sets (2015)
  7. Rodrigues, Bernardo G.; Tonchev, Vladimir D.: On quasi-symmetric 2-$(64, 24, 46)$ designs derived from codes (2015)
  8. Abrams, Lowell; Berman, Yosef: Connected pseudoachromatic index of complete graphs (2014)
  9. Fontana, Roberto: Random Latin squares and Sudoku designs generation (2014)
  10. Nagy, Gábor P.: Linear groups as right multiplication groups of quasifields (2014)
  11. Abeledo, Hernán; Fukasawa, Ricardo; Pessoa, Artur; Uchoa, Eduardo: The time dependent traveling salesman problem: polyhedra and algorithm (2013)
  12. Chee, Yeow Meng; Kiah, Han Mao; Wang, Chengmin: Generalized balanced tournament designs with block size four (2013)
  13. Kizhakkepallathu, Ashik Mathew; Östergård, Patric Rj; Popa, Alexandru: On the Shannon capacity of triangular graphs (2013)
  14. Kurz, Sascha; Tautenhahn, Nikolas: On Dedekind’s problem for complete simple games (2013)
  15. Mathew, K.Ashik; Östergård, Patric R.J.; Popa, Alexandru: Enumerating cube tilings (2013)
  16. Östergård, Patric R.J.: On optimal binary codes with unbalanced coordinates (2013)
  17. Behbahani, Majid; Lam, Clement; Östergård, Patric R.J.: On triple systems and strongly regular graphs (2012)
  18. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.: A branch-and-cut procedure for the Udine course timetabling problem (2012)
  19. Hartke, Stephen G.; Stolee, Derrick: Uniquely $K_r$-saturated graphs (2012)
  20. Held, Stephan; Cook, William; Sewell, Edward C.: Maximum-weight stable sets and safe lower bounds for graph coloring (2012)

1 2 next