Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

A couple of weeks ago, I attended and spoke at the first stop in the Neo4j GraphTour in Washington D.C. and I was able to get the best answer yet to a question that I’d been pondering: what’s the ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Machine learning, task automation and robotics are already widely used in business. These and other AI technologies are about to multiply, and we look at how organizations can best take advantage of ...

Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This ...