Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...

Korean research institute Kaist has found a way to develop a one trillion edge graph algorithm on a single computer without storing the graph in the main memory or on disc. ‘Develop’ is the important ...

A comprehensive toolkit for discovering fast matrix multiplication algorithms using flip graph exploration with support for Z₂, Z₃ and ternary coefficient sets. Discover optimal matrix multiplication ...

It hadn’t occurred to me in quite these terms before, but Google has an algorithm for its Knowledge Graph. I have been tracking the Knowledge Graph API for five years. The resultScores have always ...

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

RRT is a generally effective algorithm for pathfinding from a start point to a goal point. It is commonly used to guide robots by discovering a viable path through an unknown configuration space. This ...

Like the core algorithm, Google’s Knowledge Graph periodically updates. But little has been known about how, when, and what it means — until now. I believe these updates consist of three things: ...

As mathematical abstractions go, graphs are among the simplest. Scatter a bunch of points in a plane. Connect some of them with lines. That’s all a graph is. And yet they are incredibly powerful. They ...