On the public citation graph
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
0 signed · 72 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800020407openalex-snapshot
Computation of maximal flows in networks
inferredcites →https://doi.org/10.1007/bf01580869openalex-snapshot
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
inferredcites →https://doi.org/10.1007/bf02288321openalex-snapshot
A computational comparison of the dinic and network simplex methods for maximum flow
inferredcites →https://doi.org/10.1007/bfb0121089openalex-snapshot
An efficient implementation of the network simplex method
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1057/jors.1981.81openalex-snapshot
Algorithms for Network Programming
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/moor.16.2.272openalex-snapshot
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
inferredcites →https://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200005)35:3<173::aid-net1>3.0.co;2-wopenalex-snapshot
Clustering for faster network simplex pivots
inferred← citeshttps://doi.org/10.1006/jagm.1996.0835openalex-snapshot
A Data Structure for Dynamically Maintaining Rooted Trees
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_6openalex-snapshot
Maintaining Center and Median in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_476openalex-snapshot
Optimization in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-00551-5_5openalex-snapshot
Stochastic Decentralized Routing of Unsplittable Vehicle Flows Using Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_13openalex-snapshot
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_7openalex-snapshot
Dynamic Trees in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_11openalex-snapshot
The Network Simplex Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-015-8330-5_2openalex-snapshot
On the Complexity of the Simplex Method
inferred← citeshttps://doi.org/10.1007/bf01580604openalex-snapshot
A polynomial-time simplex method for the maximumk-flow problem
inferred← citeshttps://doi.org/10.1007/bf01580615openalex-snapshot
Polynomial dual network simplex algorithms
inferred← citeshttps://doi.org/10.1007/bf01582129openalex-snapshot
Strongly polynomial dual simplex methods for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/bf01758840openalex-snapshot
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.1007/bf02614365openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.1007/bf02614368openalex-snapshot
On strongly polynomial dual simplex algorithms for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/bf02614369openalex-snapshot
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
inferred← citeshttps://doi.org/10.1007/s11590-006-0016-3openalex-snapshot
Maximum flow problem in wireless ad hoc networks with directional antennas
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90148-hopenalex-snapshot
On the maximum capacity augmentation algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90039-ropenalex-snapshot
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferred← citeshttps://doi.org/10.1016/j.cor.2008.01.001openalex-snapshot
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00052-1openalex-snapshot
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00269-xopenalex-snapshot
Computational investigations of maximum flow algorithms
inferred← citeshttps://doi.org/10.1051/ro/2012015openalex-snapshot
On a dual network exterior point simplex type algorithm and its computational behavior
inferred← citeshttps://doi.org/10.1080/02331939508844049openalex-snapshot
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
inferred← citeshttps://doi.org/10.1109/43.998628openalex-snapshot
Fast and exact transistor sizing based on iterative relaxation
inferred← citeshttps://doi.org/10.1137/1.9781611977073.127openalex-snapshot
Augmenting Edge Connectivity via Isolating Cuts
inferred← citeshttps://doi.org/10.1137/120864271openalex-snapshot
Multiple-Source Shortest Paths in Embedded Graphs
inferred← citeshttps://doi.org/10.1137/18m1197205openalex-snapshot
A Friendly Smoothed Analysis of the Simplex Method
inferred← citeshttps://doi.org/10.1145/1103963.1103966openalex-snapshot
Maintaining information in fully dynamic trees with top trees
inferred← citeshttps://doi.org/10.1145/1921659.1921660openalex-snapshot
Data structures for mergeable trees
inferred← citeshttps://doi.org/10.1145/2422436.2422468openalex-snapshot
Reachability in graph timelines
inferred← citeshttps://doi.org/10.1145/2629654openalex-snapshot
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
inferred← citeshttps://doi.org/10.1145/3188745.3188826openalex-snapshot
A friendly smoothed analysis of the simplex method
inferred← citeshttps://doi.org/10.1145/3626183.3659976openalex-snapshot
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
inferred← citeshttps://doi.org/10.1287/moor.16.2.272openalex-snapshot
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
inferred← citeshttps://doi.org/10.1287/opre.1080.0524openalex-snapshot
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
inferred← citeshttps://doi.org/10.21236/ada254340openalex-snapshot
Polynomial Dual Network Simplex Algorithms
inferred← citeshttps://doi.org/10.22215/etd/2008-08073openalex-snapshot
Algorithms for static and dynamic path problems in trees
inferred← citeshttps://doi.org/10.2298/yjor0901157gopenalex-snapshot
A dual exterior point simplex type algorithm for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.4156/jcit.vol7.issue7.21openalex-snapshot
Algorithm for Minimum Cost Maximum Flow in Transportation Network
inferred← citeshttps://doi.org/10.47749/t/unicamp.1992.42531openalex-snapshot
Um estudo do algoritmo de Goldberg e Tarjan para o problema de luxo maximo
inferred← citeshttps://doi.org/10.5555/313852.314105openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.5555/314464.314490openalex-snapshot
Clustering for faster network simplex pivots
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.