Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...

It might not be as bright and shiny as some of the other topics that we've seen here, but there's no denying that the work of Julian Shun and his team is going to be applicable to a lot of the ...

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

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

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 monthly overview of things you need to know as an architect or aspiring architect. Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with ...

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