On the public citation graph

Metrics and undirected cuts

https://doi.org/10.1007/bf01586090
0 signed · 36 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.1002/net.3230100108openalex-snapshot
Four‐terminus flows
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/springerreference_5846openalex-snapshot
Multicommodity network flows
inferredcites →https://doi.org/10.1016/0012-365x(78)90116-4openalex-snapshot
A two-commodity cut theorem
inferredcites →https://doi.org/10.1109/tct.1971.1083312openalex-snapshot
On feasibility conditions of multicommodity flows in networks
inferredcites →https://doi.org/10.1287/opre.11.3.344openalex-snapshot
Multi-Commodity Network Flows
inferredcites →https://doi.org/10.1287/opre.14.3.377openalex-snapshot
On Two Commodity Network Flows
inferredcites →https://doi.org/10.4153/cjm-1980-010-0openalex-snapshot
On the Extreme Rays of the Metric Cone

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.21621openalex-snapshot
The cut property under demand uncertainty
inferred← citeshttps://doi.org/10.1002/net.3230210602openalex-snapshot
The cut cone, L1 embeddability, complexity, and multicommodity flows
inferred← citeshttps://doi.org/10.1006/aama.1997.0549openalex-snapshot
AT-Approach to Some Results on Cuts and Metrics
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_85openalex-snapshot
On integer multiflows and metric packings in matroids
inferred← citeshttps://doi.org/10.1007/978-3-0348-9112-7_16openalex-snapshot
Paths in Graphs and Curves on Surfaces
inferred← citeshttps://doi.org/10.1007/bf01580897openalex-snapshot
Facets for the cut cone I
inferred← citeshttps://doi.org/10.1007/bf02115753openalex-snapshot
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
inferred← citeshttps://doi.org/10.1007/pl00009370openalex-snapshot
Embedding into Rectilinear Spaces
inferred← citeshttps://doi.org/10.1007/s00493-010-2447-9openalex-snapshot
Metric packing for K 3+K 3
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90137-9openalex-snapshot
On fractional multicommodity flows and distance functions
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90164-dopenalex-snapshot
Packings of cuts realizing distances between certain vertices in a planar graph
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90006-3openalex-snapshot
Distances and cuts in planar graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90052-lopenalex-snapshot
Short proofs on multicommodity flows and cuts
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00087-topenalex-snapshot
Hypercube embedding of generalized bipartite metrics
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90020-5openalex-snapshot
Applications of cut polyhedra — I
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90021-3openalex-snapshot
Applications of cut polyhedra — II
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50043-9openalex-snapshot
10.1016/b978-044488002-4/50043-9
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.041openalex-snapshot
Finite metrics in switching classes
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00372-1openalex-snapshot
Integer multiflows and metric packings beyond the cut condition
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00065-xopenalex-snapshot
Fullerenes and coordination polyhedra versus half-cube embeddings
inferred← citeshttps://doi.org/10.1016/s0166-218x(87)80002-1openalex-snapshot
Half-integral five-terminus flows
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80029-7openalex-snapshot
Sums of Cuts and Bipartite Metrics
inferred← citeshttps://doi.org/10.1023/a:1022441506632openalex-snapshot
ℓ1-Rigid Graphs
inferred← citeshttps://doi.org/10.1145/1361192.1361199openalex-snapshot
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
inferred← citeshttps://doi.org/10.1504/ijcsm.2015.072962openalex-snapshot
Algorithms for the remoteness function, and the median and antimedian sets in ℓ1-graphs
inferred← citeshttps://doi.org/10.3390/sym14112260openalex-snapshot
The l1-Embeddability of Hypertrees and Unicyclic Hypergraphs
inferred← citeshttps://doi.org/10.5555/1070432.1070447openalex-snapshot
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
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.