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

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee.

To lighten the computational burden, the PNNL team turned to a type of algorithm known as graph coloring—a specialty of Ferdous and Halappanavar. That approach allows researchers to explore ...