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

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

It might not be as bright and shiny as some of the other topics that we've seen here, but there's no denying that the work of Julian Shun and his team is going to be applicable to a lot of 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 ...

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

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