In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
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...
Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...