Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...

Now a trio of computer scientists has solved this long-standing problem. Their new algorithm, which finds the shortest paths through a graph from a given “source” node to every other node, nearly ...

The graph below shows the total number of publications each year in Coxeter Theory and Graph Algorithms. References [1] Congruence of rational matrices defined by an integer matrix.

For example, a novel 0.8785-approximation algorithm for high-dimensional table compression on balanced k-partite graphs leverages semidefinite programming to achieve near-optimal performance ...

Refining with colors. Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.