A six-author team cut planar map colouring from quadratic time O(n²) to near-linear O(n log n), winning Best Paper at FOCS 2026; a follow-up paper reaches optimal linear time O(n).
Read ArticleExplore our latest tutorials, tech updates, and career advice written by industry experts to help you level up your skills.
A six-author team cut planar map colouring from quadratic time O(n²) to near-linear O(n log n), winning Best Paper at FOCS 2026; a follow-up paper reaches optimal linear time O(n).
Read ArticleAsk about courses, website & more
Request human callback:
Please log in to download. You will stay on this page after logging in!
New here? Register now →