Computer science2012 · shared on Hacker News

Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

Explore Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.

Read original

The conversation around the idea.

Original Hacker News threads. Different perspectives, questions, and things worth thinking about.

Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.

Yadulau ·

Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

74 points5 comments

One idea leads to another.

Explore more papers