Cliquer

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: http://plato.asu.edu)


References in zbMATH (referenced in 40 articles )

Showing results 1 to 20 of 40.
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. Mathew, K. Ashik; Östergård, Patric R.J.: New lower bounds for the Shannon capacity of odd cycles (2017)
  3. Carraher, James M.; Galvin, David; Hartke, Stephen G.; Radcliffe, A.J.; Stolee, Derrick: On the independence ratio of distance graphs (2016)
  4. Honold, Thomas; Kiermaier, Michael; Kurz, Sascha: Constructions and bounds for mixed-dimension subspace codes (2016)
  5. Kokkala, Janne I.; Östergård, Patric R.J.: Further results on the classification of MDS codes (2016)
  6. 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)
  7. Xu, Hong; Kumar, T.K.Satish; Koenig, Sven: A new solver for the minimum weighted vertex cover problem (2016)
  8. 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)
  9. Ćustić, Ante; Krčadinac, Vedran; Zhou, Yue: Tiling groups with difference sets (2015)
  10. Rodrigues, Bernardo G.; Tonchev, Vladimir D.: On quasi-symmetric 2-$(64, 24, 46)$ designs derived from codes (2015)
  11. Abrams, Lowell; Berman, Yosef: Connected pseudoachromatic index of complete graphs (2014)
  12. Fontana, Roberto: Random Latin squares and Sudoku designs generation (2014)
  13. Nagy, Gábor P.: Linear groups as right multiplication groups of quasifields (2014)
  14. Abeledo, Hernán; Fukasawa, Ricardo; Pessoa, Artur; Uchoa, Eduardo: The time dependent traveling salesman problem: polyhedra and algorithm (2013)
  15. Chee, Yeow Meng; Kiah, Han Mao; Wang, Chengmin: Generalized balanced tournament designs with block size four (2013)
  16. Kizhakkepallathu, Ashik Mathew; Östergård, Patric Rj; Popa, Alexandru: On the Shannon capacity of triangular graphs (2013)
  17. Kurz, Sascha; Tautenhahn, Nikolas: On Dedekind’s problem for complete simple games (2013)
  18. Mathew, K.Ashik; Östergård, Patric R.J.; Popa, Alexandru: Enumerating cube tilings (2013)
  19. Östergård, Patric R.J.: On optimal binary codes with unbalanced coordinates (2013)
  20. Behbahani, Majid; Lam, Clement; Östergård, Patric R.J.: On triple systems and strongly regular graphs (2012)

1 2 next