The space complexity of the maximum flow problem is investigated. It is shown that the problem is log space complete for deterministic polynomial time. Thus the maximum flow problem probably has no algorithm which needs only O(logk n) storage space for any constant k. Another consequence is that there is probably no fast parallel algorithm for the maximum flow problem
This paper gives the first o(n^{2.5}) deterministic algorithm for the maximum flow problem in any un...
This paper defines a hierarchical version of the maximum flow problem. In this model, the capaciti...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
AbstractThe space complexity of the maximum flow problem is investigated. It is shown that the probl...
AbstractThe space complexity of the maximum flow problem is investigated. It is shown that the probl...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
We show that it is impossible, in NC, to approximate the value of the minimumcost maximum flow unles...
We show that a maximum flow in a network with $n$ vertices can be computed deterministically in $O({...
AbstractIt is shown that the problem of whether the maximum flow in a given network exceeds a given ...
Darbs ir veltīts maksimālās plūsmas problēmai un tās risināšanas metodēm. Darbs satur grafa teorijas...
We consider the maximum flow problem with minimum quantities (MFPMQ), which is a variant of the maxi...
This paper gives the first o(n^{2.5}) deterministic algorithm for the maximum flow problem in any un...
We show that a maximum flow in a network with $n$ vertices can be computed deterministically in $O({...
This paper gives the first o(n^{2.5}) deterministic algorithm for the maximum flow problem in any un...
This paper defines a hierarchical version of the maximum flow problem. In this model, the capaciti...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
AbstractThe space complexity of the maximum flow problem is investigated. It is shown that the probl...
AbstractThe space complexity of the maximum flow problem is investigated. It is shown that the probl...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
We show that it is impossible, in NC, to approximate the value of the minimumcost maximum flow unles...
We show that a maximum flow in a network with $n$ vertices can be computed deterministically in $O({...
AbstractIt is shown that the problem of whether the maximum flow in a given network exceeds a given ...
Darbs ir veltīts maksimālās plūsmas problēmai un tās risināšanas metodēm. Darbs satur grafa teorijas...
We consider the maximum flow problem with minimum quantities (MFPMQ), which is a variant of the maxi...
This paper gives the first o(n^{2.5}) deterministic algorithm for the maximum flow problem in any un...
We show that a maximum flow in a network with $n$ vertices can be computed deterministically in $O({...
This paper gives the first o(n^{2.5}) deterministic algorithm for the maximum flow problem in any un...
This paper defines a hierarchical version of the maximum flow problem. In this model, the capaciti...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
DOI
Add to ORKG