Add to ORKGWe give an O(n log3 n) algorithm that, given an n-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes, finds a maximum flow from the sources to the sinks. Previously, the fastest algorithms known for this problem were those for general graphs. ar X i
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
We give an O(n1.5 logn) algorithm that, given a directed planar graph with arc capacities, a set of ...
Abstract. In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed ...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca...
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
Abstract. We give an iterative algorithm for finding the maximum flow between a set of sources and s...
Let N be a single-source single-sink flow network with n nodes, m arcs, and positive arc costs. We p...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
We study the maximum flow problem in an undirected planar network with both edge and vertex capaciti...
[[abstract]]In this paper we present a distributed algorithm for maximum flow in a planar network wi...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Several researchers have recently developed new techniques that give fast algorithms for the minimum...
We give an O(n1.5 logn) algorithm that, given a directed planar graph with arc capacities, a set of ...
Abstract. In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed ...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca...
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
Abstract. We give an iterative algorithm for finding the maximum flow between a set of sources and s...
Let N be a single-source single-sink flow network with n nodes, m arcs, and positive arc costs. We p...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
We study the maximum flow problem in an undirected planar network with both edge and vertex capaciti...
[[abstract]]In this paper we present a distributed algorithm for maximum flow in a planar network wi...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Several researchers have recently developed new techniques that give fast algorithms for the minimum...