Multiflow

For vertex-capacitated multiflows the unary case has to be distinguished from vertex-disjoint paths if G is restricted for instance to planar graphs.

Given that several dependency types flow through the networks, multicommodity flows or multiflows is a natural theoretical framework to map the presented model for further investigations.

Despite these restricted multiflows, the gap between integer and half-integer flow is at least 1/2 for these graphs […]