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

Network flow watermarking is an advanced technique that embeds covert information into the characterising features of network traffic flows. By subtly modifying timing characteristics such as ...

We consider a dynamic network flow problem where the arc capacities are random variables. This gives a multistage stochastic linear program. We describe the randomness using a multi-scenario approach.

We consider a problem in which a fleet of vehicles must be scheduled to pickup and deliver a set of orders in truckload quantities. We describe a new algorithm based on a network flow relaxation which ...

In Ten Lectures on Event Structure in a Network Theory of Language, Nikolas Gisborne explores verb meaning. He discusses theories of events and how a network model of language-in-the-mind should be ...