On the public citation graph

A Distributed Algorithm for the Maximum Flow Problem

0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1994.1044openalex-snapshot
A Faster Deterministic Maximum Flow Algorithm
inferredcites →https://doi.org/10.1007/bfb0054350openalex-snapshot
Recent developments in maximum flow algorithms
inferredcites →https://doi.org/10.1007/pl00009180openalex-snapshot
On Implementing the Push—Relabel Method for the Maximum Flow Problem
inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot
Scaling algorithms for network problems
inferredcites →https://doi.org/10.1016/0166-218x(94)90171-6openalex-snapshot
Network flows: Theory, algorithms and applications
inferredcites →https://doi.org/10.1016/s0020-0190(99)00019-8openalex-snapshot
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
inferredcites →https://doi.org/10.1016/s0167-8191(03)00022-xopenalex-snapshot
The maximum flow problem: a real-time approach
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/infcom.2004.1354529openalex-snapshot
Power-aware base station positioning for sensor networks
inferredcites →https://doi.org/10.1137/s0097539791221529openalex-snapshot
A Randomized Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1145/140901.140919openalex-snapshot
On the parallel implementation of Goldberg's maximum flow algorithm
inferredcites →https://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.5860/choice.34-5136openalex-snapshot
An introduction to distributed algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.jnca.2015.04.004openalex-snapshot
An efficient distributed max-flow algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/appeec.2009.4918341openalex-snapshot
Evaluating Robustness of Power Systems Based on Their Topological Structure Using Maximum-Flow Algorithm
inferred← citeshttps://doi.org/10.1109/hipc.2010.5713166openalex-snapshot
Fair bandwidth allocation in wireless mobile environment using max-flow
inferred← citeshttps://doi.org/10.1109/hpcc.2014.213openalex-snapshot
A Synchronous Parallel Max-Flow Algorithm for Real-World Networks
inferred← citeshttps://doi.org/10.1109/icbc48266.2020.9169405openalex-snapshot
HushRelay: A Privacy-Preserving, Efficient, and Scalable Routing Algorithm for Off-Chain Payments
inferred← citeshttps://doi.org/10.1109/icc.2012.6363781openalex-snapshot
EDR2: A sink failure resilient approach for WSNs
inferred← citeshttps://doi.org/10.1109/icccsp.2018.8452822openalex-snapshot
Smart Bus Rerouting
inferred← citeshttps://doi.org/10.1109/icnc.2012.6234734openalex-snapshot
An improved algorithm for solving maximum flow problem
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934938openalex-snapshot
The impact of storage capacity on end-to-end delay in time varying networks
inferred← citeshttps://doi.org/10.1109/ipdps.2013.23openalex-snapshot
Distributed Algorithms for Joint Routing and Frame Aggregation in 802.11n Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/msn53354.2021.00039openalex-snapshot
Distributed Routing Protocol for Large-Scale Backscatter-enabled Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/rivf.2006.1696436openalex-snapshot
An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network
inferred← citeshttps://doi.org/10.1109/tc.2021.3065527openalex-snapshot
Distributed Detection of Minimum Cuts in Wireless Multi-Hop Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2011.113011.100098openalex-snapshot
Smart Association Control in Wireless Mobile Environment Using Max-Flow
inferred← citeshttps://doi.org/10.1109/tpds.2013.17openalex-snapshot
Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1109/wi-iat.2013.136openalex-snapshot
Decentralized Telescope Management for Satellite Tracking
inferred← citeshttps://doi.org/10.1145/3519270.3538443openalex-snapshot
From Switch Scheduling to Datacenter Scheduling
inferred← citeshttps://doi.org/10.1145/3765897openalex-snapshot
A Survey on Off-chain Technologies
inferred← citeshttps://doi.org/10.12681/eadd/26952openalex-snapshot
Spectrum and storage capacity management using network economics and optimization methods
inferred← citeshttps://doi.org/10.14778/3342263.3342645openalex-snapshot
Efficient algorithms for densest subgraph discovery
inferred← citeshttps://doi.org/10.3141/2477-05openalex-snapshot
Application of Minimum-Cost Flow Problem for Shuttle Tanker Transportation Planning
inferred← citeshttps://doi.org/10.4236/cn.2017.91003openalex-snapshot
Operation Research Based Techniques in Wireless Sensors Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1200openalex-snapshot
Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting
inferred← citeshttps://doi.org/10.5555/2484920.2485148openalex-snapshot
Telescope management for satellite tracking: a decentralized approach
inferred← citeshttps://doi.org/10.57709/4072106openalex-snapshot
Collaborative Communication And Storage In Energy-Synchronized Sensor Networks
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.