Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

With the rapid development of mobile networks, location-based services have become deeply embedded in people's daily lives. Although the k-NN search problem has obtained a lot of research results, the ...

A research team has developed a new technology that enables to process a large-scale graph algorithm without storing the graph in the main memory or on disks. A KAIST research team has developed a new ...

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

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

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 new open-source library by Nvidia could be the secret ingredient to advancing analytics and making graph databases faster. The key: parallel processing on Nvidia GPUs. Nvidia has long ago stopped ...