Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in this ...

There is a kind of link algorithm that isn’t widely discussed, not nearly enough. This article is meant as introduction to link and link distance ranking algorithms. It’s something that may play a ...

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

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

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

Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in ...

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

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