scientific article; zbMATH DE number 65738
From MaRDI portal
Publication:4010349
zbMATH Open0749.90027MaRDI QIDQ4010349FDOQ4010349
Authors: Robert E. Tarjan 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (34)
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- A fast algorithm for the minimax flow problem with 0/1 weights
- Range-restricted mergeable priority queues
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Quick max-flow algorithm
- Fuzzy intersection graphs
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms
- Title not available (Why is that?)
- A reoptimization algorithm for the shortest path problem with time windows
- A simplified construction of nonlinear Davenport-Schinzel sequences
- ``Global graph problems tend to be intractable
- Shortest path algorithms for nearly acyclic directed graphs
- Maintaining a topological order under edge insertions
- Generalized Davenport-Schinzel sequences with linear upper bound
- Gradients and flows: continuous optimization approaches to the maximum flow problem
- The lexicographically first topological order problem is NLOG-complete
- On an optimization problem with nested constraints
- Efficient preflow push algorithms
- Title not available (Why is that?)
- Max flows in \(O(nm)\) time, or better
- Lower bounds for planar orthogonal drawings of graphs
- An efficient algorithm for the all pairs suffix-prefix problem
- Algorithms for approximate graph matching
- Computing and Combinatorics
- Most and least uniform spanning trees
- Approximate decision algorithms for point set congruence
- Optimal channel allocation for several types of cellular radio networks
- Title not available (Why is that?)
- Network flow algorithms
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- Algorithms for maximum network flow
- Efficient algorithms for the maximum concurrent flow problem
- Discrete warehouse problem
- On finding most uniform spanning trees
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)
