On the public citation graph
Can a maximum flow be computed in o(nm) time?
0 signed · 62 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.1016/0020-0190(90)90024-ropenalex-snapshot
Generating pseudo-random permutations and maximum flow algorithms
inferredcites →https://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferredcites →https://doi.org/10.1109/sfcs.1989.63465openalex-snapshot
A randomized maximum-flow algorithm
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/net.22169openalex-snapshot
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
inferred← citeshttps://doi.org/10.1006/jagm.1994.1043openalex-snapshot
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_122openalex-snapshot
Recent developments in algorithms for the maximum-flow problem
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_18openalex-snapshot
A framework for analyzing locality and portability issues in parallel computing
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_49openalex-snapshot
On implementing push-relabel method for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_141openalex-snapshot
Maximum skew-symmetric flows
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_61openalex-snapshot
All-pairs min-cut in sparse networks
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_22openalex-snapshot
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_20openalex-snapshot
Eine O(e log e) — Heuristik für ein Flußproblem
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_14openalex-snapshot
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_102openalex-snapshot
Einige Bemerkungen zu algorithmischen Verbesserungen für den Preflow-Push-Ansatz zur Bestimmung maximaler Flüsse
inferred← citeshttps://doi.org/10.1007/978-3-642-76119-5_54openalex-snapshot
Neue Algorithmen für das Maximum-Flow-Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-77489-8_3openalex-snapshot
An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_3openalex-snapshot
Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1007/bf01187018openalex-snapshot
On the complexity of preflow-push algorithms for maximum-flow problems
inferred← citeshttps://doi.org/10.1007/bf01940880openalex-snapshot
Algorithms for Dense Graphs and Networks on the Random Access Computer
inferred← citeshttps://doi.org/10.1007/bfb0049391openalex-snapshot
Optimization algorithms for large networks
inferred← citeshttps://doi.org/10.1007/pl00009180openalex-snapshot
On Implementing the Push—Relabel Method for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/s004460050034openalex-snapshot
A self-stabilizing algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90195-nopenalex-snapshot
Computing a maximum cardinality matching in a bipartite graph in time O(n1.5)
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.029openalex-snapshot
On complexity of special maximum matchings constructing
inferred← citeshttps://doi.org/10.1016/s0305-0483(99)00037-7openalex-snapshot
Maximizing workforce diversity in project teams: a network flow approach
inferred← citeshttps://doi.org/10.1016/s0305-0548(01)00062-4openalex-snapshot
Search for all d-Mincuts of a limited-flow network
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00143-4openalex-snapshot
A cell formation algorithm: Hypergraph approximation - Cut tree
inferred← citeshttps://doi.org/10.1016/s0951-8320(00)00070-3openalex-snapshot
A simple approach to search for all d-MCs of a limited-flow network
inferred← citeshttps://doi.org/10.1038/s42005-019-0147-3openalex-snapshot
End-to-end capacities of a quantum communication network
inferred← citeshttps://doi.org/10.1109/etcs.2009.248openalex-snapshot
Optimal Peer Selection, Task Assignment and Rate Allocation for P2P Downloading
inferred← citeshttps://doi.org/10.1109/fcst.2009.37openalex-snapshot
A Local Algorithm for Checking Probabilistic Bisimilarity
inferred← citeshttps://doi.org/10.1109/focs.2013.23openalex-snapshot
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors
inferred← citeshttps://doi.org/10.1109/icnc.2008.318openalex-snapshot
Deciding Algorithm for Simulation Equivalence on MTIPP
inferred← citeshttps://doi.org/10.1109/pccc.1995.472519openalex-snapshot
A self-stabilizing algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646087openalex-snapshot
Beyond the flow decomposition barrier
inferred← citeshttps://doi.org/10.1137/s0097539791221529openalex-snapshot
A Randomized Maximum-Flow Algorithm
inferred← citeshttps://doi.org/10.1145/167088.167201openalex-snapshot
Online load balancing and network flow
inferred← citeshttps://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferred← citeshttps://doi.org/10.1145/195058.195084openalex-snapshot
A randomized linear-time algorithm for finding minimum spanning trees
inferred← citeshttps://doi.org/10.1145/201019.201022openalex-snapshot
A randomized linear-time algorithm to find minimum spanning trees
inferred← citeshttps://doi.org/10.1145/2579818openalex-snapshot
Symbolic Bisimulation for Quantum Processes
inferred← citeshttps://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferred← citeshttps://doi.org/10.1287/opre.40.5.923openalex-snapshot
An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
inferred← citeshttps://doi.org/10.15807/jorsj.43.2openalex-snapshot
RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS
inferred← citeshttps://doi.org/10.2172/885861openalex-snapshot
Computing Path Tables for Quickest Multipaths In Computer Networks
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.31274/rtd-180813-9550openalex-snapshot
The assignment problem in distributed computing
inferred← citeshttps://doi.org/10.48550/arxiv.0707.2295openalex-snapshot
Two polynomial algorithms for special maximum matching constructing in trees
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4577openalex-snapshot
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.48550/arxiv.1601.00966openalex-snapshot
Capacities of repeater-assisted quantum communications
inferred← citeshttps://doi.org/10.48550/arxiv.1605.06989openalex-snapshot
Experimental Evaluation of Modified Decomposition Algorithm for Maximum Weight Bipartite Matching
inferred← citeshttps://doi.org/10.54337/aau300041621openalex-snapshot
Behavioural Preorders on Stochastic Systems - Logical, Topological, and Computational Aspects
inferred← citeshttps://doi.org/10.7561/sacs.2020.1.39openalex-snapshot
A Modified Decomposition Algorithm for Maximum Weight Bipartite Matching and Its Experimental Evaluation
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.