A big breakthrough in the Graph Isomorphism Problem
The graph isomorphism problem asks the computer to see if two graphs (simple networks) can be made to look precisely the same if the computer is only allowed to slide the nodes and stretch the connections (so the computer is not allowed to draw or or erase nodes or connections).