From here graph theory got expanded and generalized ... to this basic algorithm is probably the A* algorithm (geometric goal directed search), which was developed in 1968 at Stanford Research ...

For decades computer scientists had been trying to develop a fast algorithm for determining when it’s possible to add edges to a graph so that it remains “planar,” meaning none of its edges cross each ...

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 ...