66 citations · 91 across the 13 of their papers we have counts for
1 paper · 1 filter
Brendan Ames, Stephen Vavasis
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matri…