The package contains a handful of different solvers with different performance/solution quality trade-offs. For example, to find clique covers of the Johnson graph J ( 9 , 4 ) , examples of different ...

Find an implement "efficient" algorithms to compute the maximal clique in the Hamming graph (but note that the problem to compute maximal cliques is NP-hard) in c++.

The approach constructs a visibility graph using sampling and generates a clique cover of this graph to find clusters of samples that have mutual line of sight. These clusters are then inflated into ...