Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Use the idea[1] at work to make large NP-complete problems more tractable by breaking the problem up into disjoint subsets.

[1] doesn't implement the inverse-ackermann algorithm but still implemented as union/find.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: