A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Methods used to sequence the transcriptome often produce more than 200 million short sequences. We introduce StringTie, a computational method that applies a network flow algorithm originally ...

Network slowdowns could soon be a thing of the past, thanks to a superfast new algorithm. The breakthrough offers a dramatically faster solution to a problem that has been plaguing computer scientists ...

Computer scientists at ETH Zurich have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum ...

This is a preview. Log in through your library . Abstract The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms ...

In many actual network flow situations, nodes as well as arcs have limited capacities. This paper presents, for such a network, an algorithm for maximizing flow from a source node to a sink node. The ...