Graph isomorphism in quasipolynomial time I: The “Local Certificates Algorithm.” Combinatorics and Theoretical Computer Science seminar, Chicago, November 10, 2015.

Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing ...

Babai’s proposed algorithm doesn’t bring graph isomorphism all the way into P, but it comes close. It is quasi-polynomial, he asserts, which means that for a graph with n nodes, the algorithm’s ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they ...

This past October, as Jacob Holm and Eva Rotenberg were thumbing through a paper they’d posted a few months earlier, they realized they had been sitting on something big.. For decades computer ...

The team proposed Graph-Decomposed k-NN Searching Algorithm to improve the time-efficiency of nearest nodes searching. In the research, A graph-decomposed tree is constructed from road network.