or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they cannot be applied verbatim to the reality of graph ...

This is the case with an important problem in computer science called "graph isomorphism testing" whereby scientists use ...

They presented it in June at the ACM Symposium on Theory of Computing, where they detailed an exponentially better method for checking whether a graph is planar. “The new algorithm is a remarkable ...