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

Our algorithm ... graph analytics. The team tested graph coloring in simulations of large hydrogen model systems, which are incredibly complex testbeds—simple chemical compositions that demand ...