AbstractIt is shown that the problem of whether the maximum flow in a given network exceeds a given natural number is logspace many-one complete for P if the edge capacities are presented in binary (even if the problem is restricted to acyclic graphs). This improves a result by Goldschlager et al. (1982) that this problem is logspace Turing complete for P
The space complexity of the maximum flow problem is investigated. It is shown that the problem is lo...
We show that it is impossible, in NC, to approximate the value of the minimumcost maximum flow unles...
P versus NP is considered as one of the most important open problems in computer science. This consi...
AbstractIt is shown that the problem of whether the maximum flow in a given network exceeds a given ...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
AbstractThe space complexity of the maximum flow problem is investigated. It is shown that the probl...
The space complexity of the maximum flow problem is investigated. It is shown that the problem is lo...
We show that it is impossible, in NC, to approximate the value of the minimumcost maximum flow unles...
P versus NP is considered as one of the most important open problems in computer science. This consi...
AbstractIt is shown that the problem of whether the maximum flow in a given network exceeds a given ...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
P versus NP is considered as one of the most important open problems in computer science. This consi...
AbstractThe space complexity of the maximum flow problem is investigated. It is shown that the probl...
The space complexity of the maximum flow problem is investigated. It is shown that the problem is lo...
We show that it is impossible, in NC, to approximate the value of the minimumcost maximum flow unles...
P versus NP is considered as one of the most important open problems in computer science. This consi...
DOI
Add to ORKG