5 search results - page 1 / 1 » Solving Maximum Flow Problems on Real World Bipartite Graphs |
ALENEX
2009
13 years 6 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
JAL
2006
13 years 5 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
ESOP
2006
Springer
13 years 8 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
WEA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
GIS
2005
ACM
14 years 6 months ago
2005
ACM
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...