I have a problem that I was able to simulate how to find maximum biklik (full bipartite graphs) in a bipartite graph. I know the Bron Kerbosch algorithm for detecting maximum clicks, and it seems to me that there should be a way to express the glare problem as clicks. Does anyone have a solution, either in order to create a glare problem as a click, or as an available algorithm for detecting glare directly?
source
share