In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edge-disjoint paths. We give a survey of known results about the complexity and approximability of MEDP and sketch some of the main ideas that have been used to obtain approximation algorithms for the problem. We...

We propose a new algorithm for the max-flow problem. It consists of a sequence of augmentations along paths constructed by an auction-like algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much less computation than the shortest augmenting paths used by competing methods. Our algorithm outperfo...

Minimum cuts have been closely related to shortest paths in planar graphs via planar duality – so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason – so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no c...

Die Modelle, die in der Automobilindustrie zur Modellbasierten Softwareentwicklung von eingebetteten Systemen verwendet werden, werden immer größer und komplexer. Zwar findet die Modellbasierte Entwicklung auf einer höheren Abstraktionsebene als die herkömmliche, handcodierte Softwareentwicklung statt, jedoch resultieren im Modell gemachte Fehler direkt in Fehler im Quellcode. Dieses Research A...

The cells of perfused rabbit collecting tubules swell and the intercellular spaces widen during osmotic flow of water from lumen to bath induced by antidiuretic hormone (ADH). Ouabain had no influence on these changes. In the absence of net water flow intercellular width was unaffected when tubules were swollen in hypotonic external media. Therefore, during ADH-induced flow widening of intercel...

In temporal networks, where nodes interact via sequences of temporary events, information or resources can only flow through paths that follow the time ordering of events. Such temporal paths play a crucial role in dynamic processes. However, since networks have so far been usually considered static or quasistatic, the properties of temporal paths are not yet well understood. Building on a defi...

We address the question of optimal rate allocation for multipath unicast traffic, with theobjective of maximizing the total system utility. First, we consider the problem where the setof paths (routes) between each flow is predetermined, and show how the optimal rates on thesepaths can be computed. We then consider the problem where the paths are not predetermined,and present an...

Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by the fewest number of colours so that paths of the same colour do not share an arc. We prove that this minimum number of colours is equal to the maximum number of paths that share one arc, minimized ov...

In this work, we report the control of a microparticle position within fluid flow based on its size by using a repulsive force generated with negative dielectrophoresis (n-DEP). The n-DEP based fluidic channel, which was consisted of navigator and separator electrodes, was used to manipulate the particle flow in the center of channel and to control the particle position in the fluidic flow. The...

We present a novel algorithm for the geometric extraction of stream volume segmentation for visualization of grid-less flow simulation. Our goal is the segmentation of different paths through a mixing tube where the flow is represented by scattered point sets approximated with moving least squares. The key challenges are the watertight construction of boundary representations from separatrices....