18 citations · 39 across the 6 of their papers we have counts for
1 paper · 1 filter
Marco Budinich, Paolo Budinich
We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form…