On the public citation graph
Efficient algorithms for the minimum range cut problems
0 signed · 41 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1006/jagm.1994.1044openalex-snapshot
A Faster Deterministic Maximum Flow Algorithm
inferredcites →https://doi.org/10.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
inferredcites →https://doi.org/10.1007/bf02115755openalex-snapshot
Ancestor tree for arbitrary multi-terminal cut functions
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90054-0openalex-snapshot
On the complexity of computations under varying sets of primitives
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0166-218x(86)90041-7openalex-snapshot
Most and least uniform spanning trees
inferredcites →https://doi.org/10.1016/0166-218x(88)90062-5openalex-snapshot
On finding most uniform spanning trees
inferredcites →https://doi.org/10.1016/0167-6377(84)90061-0openalex-snapshot
Balanced optimization problems
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
inferredcites →https://doi.org/10.1109/fscs.1990.89594openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1109/sfcs.1987.19openalex-snapshot
Determining edge connectivity in 0(nm)
inferredcites →https://doi.org/10.1109/sfcs.1991.185453openalex-snapshot
Applications of a poset representation to edge connectivity and graph rigidity
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0405004openalex-snapshot
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/103418.103436openalex-snapshot
A matroid approach to finding edge connectivity and packing arborescences
inferredcites →https://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/73393.73418openalex-snapshot
Computing Euclidean maximum spanning trees
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.5555/313559.313605openalex-snapshot
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0841openalex-snapshot
Minimum Range Balanced Cuts via Dynamic Subset Sums
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_234openalex-snapshot
How to treat delete requests in semi-online problems
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4_8openalex-snapshot
Balanced Optimization with Vector Costs
inferred← citeshttps://doi.org/10.1007/s13675-018-0093-yopenalex-snapshot
Robust balanced optimization
inferred← citeshttps://doi.org/10.1016/j.cor.2010.09.016openalex-snapshot
The balanced traveling salesmanproblem
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.01.001openalex-snapshot
The quadratic balanced optimization problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.02.017openalex-snapshot
Exact algorithms for the Equitable Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00175-0openalex-snapshot
A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00082-0openalex-snapshot
Minimum dispersion problems
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.114.4_438openalex-snapshot
A New Approximate Algorithm for the Minimum k-Cut Problem by Using Minimum Range k-Cut Algorithm
inferred← citeshttps://doi.org/10.15807/jorsj.42.88openalex-snapshot
AN EFFICIENT ALGORITHM FOR THE MINIMUM-RANGE IDEAL PROBLEM
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.