scientific article; zbMATH DE number 65738

MaRDI QIDQ4010349zbMATH OpenFDO

Authors Robert E. Tarjan

Publication date 27 September 1992

zbMATH Keywords

single-commodity maximum flow

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Recommendations

• Algorithms for maximum network flow
• scientific article; zbMATH DE number 4204092
• scientific article; zbMATH DE number 177817
• scientific article; zbMATH DE number 3900543
• Max flows in O(nm) time, or better

Cited in

(35)

• A lower bound to the complexity of Euclidean and rectilinear matching algorithms
• Most and least uniform spanning trees
• On finding most uniform spanning trees
• Fuzzy intersection graphs
• A simplified construction of nonlinear Davenport-Schinzel sequences
• A reoptimization algorithm for the shortest path problem with time windows
• Lower bounds for planar orthogonal drawings of graphs
• An efficient algorithm for the all pairs suffix-prefix problem
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• Generalized Davenport-Schinzel sequences with linear upper bound
• Shortest path algorithms for nearly acyclic directed graphs
• Approximate decision algorithms for point set congruence
• Algorithms for approximate graph matching
• A fast algorithm for the minimax flow problem with 0/1 weights
• Optimal channel allocation for several types of cellular radio networks
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• ``Global graph problems tend to be intractable
• Maintaining a topological order under edge insertions
• Efficient preflow push algorithms
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 3900543 (Why is no real title available?)
• Algorithms for maximum network flow
• scientific article; zbMATH DE number 1953188 (Why is no real title available?)
• Efficient algorithms for the maximum concurrent flow problem
• scientific article; zbMATH DE number 218386 (Why is no real title available?)
• Gradients and flows: continuous optimization approaches to the maximum flow problem
• Network flow algorithms
• Max flows in O(nm) time, or better
• Computing and Combinatorics
• The lexicographically first topological order problem is NLOG-complete
• On an optimization problem with nested constraints
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• Discrete warehouse problem
• Range-restricted mergeable priority queues
• Quick max-flow algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010349)