Holm, an assistant professor of computer science at the ... The study of such graphs is called graph theory. Engineers need to find planarity in a graph when, for example, they are designing ...

A new algorithm efficiently solves the graph isomorphism problem, computer scientist László Babai announced November 10 at a Combinatorics and Theoretical Computer Science seminar at the ...

The result could provide a deeper understanding of the nature of computing and “might be the theoretical computer science result ... into P or NP-complete, but graph isomorphism stubbornly ...