News Computing

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

By Andrew Grant

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

  1. nerve cells and a tiny robot
    Neuroscience

    Tiny, magnetically controlled robots coax nerve cells to grow connections

    By Laura Sanders
  2. gerrymandering protesters
    Computing

    How next-gen computer generated maps detect partisan gerrymandering

    By Sujata Gupta
  3. coronavirus computer illustration
    Health & Medicine

    You can help fight the coronavirus. All you need is a computer

    By Maria Temming
  4. quantum entanglement illustration
    Math

    How a quantum technique highlights math’s mysterious link to physics

    By Tom Siegfried
  5. person holding jail cell bars
    Computing

    AI can predict which criminals may break laws again better than humans

    By Maria Temming
  6. quantum entanglement illustration
    Physics

    A quantum strategy could verify the solutions to unsolvable problems — in theory

    By Emily Conover
  7. Google quantum chip
    Quantum Physics

    Google officially lays claim to quantum supremacy

    By Emily Conover
  8. Parag Pathak
    Science & Society

    Parag Pathak uses data and algorithms to make public education fairer

    By Sujata Gupta

From the Nature Index

Paid Content