Maximum clique for massive sparse graphs - biicode Blog
blog.biicode.com/maximum-clique-for-massive-sparse-graphs
The new BBMCSP algorithm uses the sparse_graph type available in GRAPH to solve maximum clique problems in sparse networks.
Comments (0)
Sign in to post comments.