Convex relaxation for the planted clique, biclique, and clustering problems
A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique (U, V ) of a bipartite graph G is a pair of disjoint, independent vertex sets such that each node in U is adjacent to every node in V in G. We consider the problems of identifying the maximum clique of a graph, kno...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/6113 |