Amazon's new cloud infrastructure, known as resilient network graph (RNG), claims to be faster, cheaper, and less ...

D-Wave is something of an anomaly in a quantum computing industry. While companies ranging from hyperscalers like Microsoft, Google, and Amazon Web Services to traditional enterprise system makers ...

Abstract: Critical network defense and attack problems, usually modeled as network interdiction, is of great significance. It is of great interest from the interdictor’s view to study saturation ...

Inspired by the Japanese art of kirigami, an MIT team has designed a technique that could transform flat panels into medical devices, habitats, and other objects without the use of tools. MIT ...

Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

Abstract: The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a ...

Chinese computer scientists have solved a 40-year-old mathematics bottleneck, an advance that might help boost performance in hi-tech areas ranging from chip design and telecommunications to drone ...

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

The original version of this story appeared in Quanta Magazine. “Obviously” is a dangerous word, even in scenarios that seem simple. Suppose, for instance, you need to do an important computation. You ...