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

For humans, identifying items in a scene — whether that’s an avocado or an Aventador, a pile of mashed potatoes or an alien mothership — is as simple as looking at them. But for artificial ...

Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Massachusetts Institute of Technology researchers have developed a method to aggregate and organize fragmented information from across the Web, something Google has been working on for years through a ...

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

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