Author

Cameron Bradley

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

HP-MC: Quickly Computing Maximum Clique Sizes of Large Sparse Graphs

This work presents a novel algorithm named HP-MC that, like prior approaches, is based on the branch and bound search, but which outperforms the leading maximum clique codes on large sparse graphs of various topologies by up to 10x on average.

Cameron Bradley, M. Burtscher · 0 citations