AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca∈A. The problem is to find a maximum flow fromstotinGsubject to these capacities. The best asymptotic bound known so far is O(nlogn·min{n,nlogC{), wheren=|V| andC=∑a∈Aca. We introduce a new algorithm, which requires only O(nlogn) time
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
We study the maximum $s,t$-flow oracle problem on planar directed graphs where the goal is to design...
Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields...
AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca...
Also issued as: Working paper (Sloan School of Management) ; WP no. 1966-87Includes bibliographical ...
Abstract. We develop a new technique for computing maximum flow in directed planar graphs with multi...
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
Abstract. In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed ...
We give an O(n log3 n) algorithm that, given an n-node directed planar graph with arc capacities, a ...
We study the maximum flow problem in an undirected planar network with both edge and vertex capaciti...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
We provide evidence that computing the maximum flow value between every pair of nodes in a directed ...
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
We study the maximum $s,t$-flow oracle problem on planar directed graphs where the goal is to design...
Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields...
AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca...
Also issued as: Working paper (Sloan School of Management) ; WP no. 1966-87Includes bibliographical ...
Abstract. We develop a new technique for computing maximum flow in directed planar graphs with multi...
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
Abstract. In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed ...
We give an O(n log3 n) algorithm that, given an n-node directed planar graph with arc capacities, a ...
We study the maximum flow problem in an undirected planar network with both edge and vertex capaciti...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
We provide evidence that computing the maximum flow value between every pair of nodes in a directed ...
In this paper we present the maximum flow algorithm in O(n log n) for directed planar graphs of Glen...
We study the maximum $s,t$-flow oracle problem on planar directed graphs where the goal is to design...
Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields...
DOI
Add to ORKG