On the public citation graph

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations

https://doi.org/10.1007/pl00009811
0 signed · 25 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.1007/bf01902503openalex-snapshot
On some connectivity properties of Eulerian graphs
inferredcites →https://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferredcites →https://doi.org/10.1016/s0167-5060(08)70459-xopenalex-snapshot
On Connectivity Properties of Eulerian Digraphs
inferredcites →https://doi.org/10.1137/s0895480195287723openalex-snapshot
On Integer Multiflow Maximization
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.21236/ada214689openalex-snapshot
Network Flow Algorithms
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.

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-540-85363-3_32openalex-snapshot
On the Query Complexity of Testing Orientations for Being Eulerian
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_11openalex-snapshot
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_10openalex-snapshot
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
inferred← citeshttps://doi.org/10.1007/s00026-012-0146-5openalex-snapshot
On Tight Spans for Directed Distances
inferred← citeshttps://doi.org/10.1007/s00224-008-9141-yopenalex-snapshot
A Fast Algorithm for the Path 2-Packing Problem
inferred← citeshttps://doi.org/10.1007/s10107-013-0713-5openalex-snapshot
Tree metrics and edge-disjoint $$S$$ S -paths
inferred← citeshttps://doi.org/10.1007/s10878-011-9377-3openalex-snapshot
Min-cost multiflows in node-capacitated undirected networks
inferred← citeshttps://doi.org/10.1007/s10878-017-0142-0openalex-snapshot
A compact representation for minimizers of k-submodular functions
inferred← citeshttps://doi.org/10.1016/j.dam.2007.02.012openalex-snapshot
Free multiflows in bidirected and skew-symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.03.001openalex-snapshot
On duality and fractionality of multicommodity flows in directed networks
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.07.002openalex-snapshot
A linear programming formulation of Mader's edge-disjoint paths problem
inferred← citeshttps://doi.org/10.1137/22m1494804openalex-snapshot
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
inferred← citeshttps://doi.org/10.1145/2151171.2151178openalex-snapshot
On the query complexity of testing orientations for being Eulerian
inferred← citeshttps://doi.org/10.15807/jorsj.53.149openalex-snapshot
A NOTE ON MULTIFLOW LOCKING THEOREM
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.519openalex-snapshot
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0125openalex-snapshot
On Min-Cost Multiflow Problem in Node-Capacitated Undirected Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1212.0224openalex-snapshot
On Weighted Multicommodity Flows in Directed 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.