KarlsruheMIS/KaMIS

Maximum independent sets and vertex covers of large sparse graphs.

1 best points · 0 comments · 1 Hacker News post · 87 GitHub stars · View on GitHub

Hacker News discussions

• KaMIS – Finding Large Independent Sets Fast (1 points, 0 comments, by 0x23, 2020-06-18)