multiflow

plural multiflows

1. graph theoryA flow function that operates on the set of edges (ordered pairs of vertices) on the intersection of two related directed graphs.

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

   2020, Naveen Garg, Nikhil Kumar, András Sebő, “Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation”, in Daniel Bienstock, Giacomo Zambelli, editors, Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings (Lecture Notes in Computer Science; 12125), Cham: Springer Nature, →ISBN, page 148

   2 more examples

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

   2008, Guyslain Naves, András Sebő, “Multiflow Feasibility: An Annotated Tableau”, in William J. Cook, László Lovász, Jens Vygen, editors, Research Trends in Combinatorial Optimization, Berlin: Springer, →ISBN, page 266

   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.

   2010, Bernhard Hämmerli, Critical Information Infrastructures Security, page 32