New algorithm cracks graph problem

Computer science ‘advance of decade’ helps identify identical networks

László Babai

YOU FOLLOW?  László Babai describes his new algorithm at the University of Chicago on November 10. The algorithm solves the tricky graph isomorphism problem faster than ever before.

Jeremy Kun

This article is only available to Science News subscribers.

Subscribers, enter your e-mail address to access our archives.

Not a subscriber?

Science News is a nonprofit.

Support us by subscribing now.

More Stories from Science News on Computing

From the Nature Index

Paid Content