On the public citation graph
Max-flow min-cut theorem in an anisotropic network
0 signed · 21 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.1007/bf01448377openalex-snapshot
Dual spaces of stresses and strains, with applications to Hencky plasticity
inferredcites →https://doi.org/10.1007/bf02052480openalex-snapshot
Sur la Séparation des Ensembles Convexes
inferredcites →https://doi.org/10.1007/bfb0087685openalex-snapshot
Convex Analysis and Measurable Multifunctions
inferredcites →https://doi.org/10.1007/bfb0121231openalex-snapshot
Continuum approximation to dense networks and its application to the analysis of urban road networks
inferredcites →https://doi.org/10.1016/0022-247x(69)90104-8openalex-snapshot
Measurable dependence of convex sets and functions on parameters
inferredcites →https://doi.org/10.1287/moor.7.4.501openalex-snapshot
A Class of Continuous Network Flow Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_14openalex-snapshot
A Hilbert Space Approach to Some Flow Problems
inferred← citeshttps://doi.org/10.1007/bf01582067openalex-snapshot
Examples of max-flow and min-cut problems with duality gaps in continuous networks
inferred← citeshttps://doi.org/10.1007/jhep07%282019%29152openalex-snapshot
Towards a bit threads derivation of holographic entanglement of purification
inferred← citeshttps://doi.org/10.1007/s002459900113openalex-snapshot
A Relaxation of a Min-Cut Problem in an Anisotropic Continuous Network
inferred← citeshttps://doi.org/10.1007/s10898-009-9471-6openalex-snapshot
Maximum flows and minimum cuts in the plane
inferred← citeshttps://doi.org/10.1051/m2an/2008040openalex-snapshot
Approximation of maximal Cheeger sets by projection
inferred← citeshttps://doi.org/10.1088/1361-6382/aab83copenalex-snapshot
Riemannian and Lorentzian flow-cut theorems
inferred← citeshttps://doi.org/10.1137/100799186openalex-snapshot
Combinatorial Continuous Maximum Flow
inferred← citeshttps://doi.org/10.1214/13-aop851openalex-snapshot
Maximal stream and minimal cutset for first passage percolation through a domain of $\mathbb{R}^{d}$
inferred← citeshttps://doi.org/10.1533/9780857099358.171openalex-snapshot
Introduction to distributions
inferred← citeshttps://doi.org/10.1533/9780857099488.183openalex-snapshot
Multiplication of Generalised Functions
inferred← citeshttps://doi.org/10.1533/9780857099488.53openalex-snapshot
Further Properties of Distributions
inferred← citeshttps://doi.org/10.1533/9780857099488.82openalex-snapshot
Generalised Functions and Fourier Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2010.05526openalex-snapshot
Large deviation principle for the streams and the maximal flow in first passage percolation
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.