The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the graph. In this paper, we define the generalized wide diameter of a graph ...

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

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

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

The original version of this story appeared in Quanta Magazine. If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a ...

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

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

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