On the public citation graph

How to make a digraph strongly connected

https://doi.org/10.1007/bf02579270
0 signed · 70 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.1016/0095-8956(76)90049-6openalex-snapshot
On two minimax theorems in graph
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.15807/jorsj.21.189openalex-snapshot
ALGORITHMS FOR SOLVING THE INDEPENDENT-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.1006/jagm.1995.1022openalex-snapshot
Centroids, Representations, and Submodular Flows
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_8openalex-snapshot
Visualizing, Finding and Packing Dijoins
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_42openalex-snapshot
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_19openalex-snapshot
Multiflots et chaînes arête-disjointes
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_5openalex-snapshot
A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_23openalex-snapshot
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_31openalex-snapshot
Robust Independence Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_18openalex-snapshot
Infeasibility of Systems of Halfspaces
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_19openalex-snapshot
Flussi multi-prodotto e cammini arco-disgiunti
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bfb0092253openalex-snapshot
Some combinatorial applications of the new linear programming algorithm
inferred← citeshttps://doi.org/10.1007/bfb0121005openalex-snapshot
A submodular network simplex method
inferred← citeshttps://doi.org/10.1007/bfb0121011openalex-snapshot
Covering directed and odd cuts
inferred← citeshttps://doi.org/10.1007/bfb0121012openalex-snapshot
Submodular systems and related topics
inferred← citeshttps://doi.org/10.1007/s00453-008-9179-xopenalex-snapshot
An Algorithm for Minimum Cost Arc-Connectivity Orientations
inferred← citeshttps://doi.org/10.1007/s00453-009-9377-1openalex-snapshot
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
inferred← citeshttps://doi.org/10.1007/s10107-010-0410-6openalex-snapshot
Fractional packing in ideal clutters
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00086-7openalex-snapshot
Approximations for the maximum acyclic subgraph problem
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90469-2openalex-snapshot
An application of submodular flows
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90029-7openalex-snapshot
Finding feasible vectors of Edmonds-Giles polyhedra
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90056-9openalex-snapshot
Polyhedral proof methods in combinatorial optimization
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50015-5openalex-snapshot
Submodular Flows
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50025-8openalex-snapshot
Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions
inferred← citeshttps://doi.org/10.1016/b978-0-444-86893-0.50022-xopenalex-snapshot
MATROIDS FROM CROSSING FAMILIES
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.03.002openalex-snapshot
An algorithm to increase the node-connectivity of a digraph by one
inferred← citeshttps://doi.org/10.1016/j.orl.2013.03.009openalex-snapshot
Tree-compositions and orientations
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00461-4openalex-snapshot
Restricted t-matchings in bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70131-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00096-5openalex-snapshot
The semantics and execution of a synchronous block-diagram language
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72446-0openalex-snapshot
An Algorithm for Submodular Functions on Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72456-3openalex-snapshot
Min-max Relations for Directed Graphs
inferred← citeshttps://doi.org/10.1023/a:1009802905533openalex-snapshot
On Integrality, Stability and Composition of Dicycle Packings and Covers
inferred← citeshttps://doi.org/10.1080/02331939608844244openalex-snapshot
A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
inferred← citeshttps://doi.org/10.1109/fscs.1990.89593openalex-snapshot
Augmenting graphs to meet edge-connectivity requirements
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366842openalex-snapshot
A framework for cost-scaling algorithms for submodular flow problems
inferred← citeshttps://doi.org/10.1137/0405003openalex-snapshot
Augmenting Graphs to Meet Edge-Connectivity Requirements
inferred← citeshttps://doi.org/10.1137/120899480openalex-snapshot
Robust Independence Systems
inferred← citeshttps://doi.org/10.1137/140980053openalex-snapshot
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
inferred← citeshttps://doi.org/10.1137/s0895480100380112openalex-snapshot
Directed Network Design with Orientation Constraints
inferred← citeshttps://doi.org/10.1142/9789814324359_0173openalex-snapshot
Submodular Functions: Optimization and Approximation
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
inferred← citeshttps://doi.org/10.1201/b19163-19openalex-snapshot
Graph Connectivity Augmentation
inferred← citeshttps://doi.org/10.1287/moor.1080.0365openalex-snapshot
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
inferred← citeshttps://doi.org/10.1287/moor.2017.0881openalex-snapshot
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
inferred← citeshttps://doi.org/10.1287/moor.2023.1352openalex-snapshot
Packing Feedback Arc Sets in Tournaments Exactly
inferred← citeshttps://doi.org/10.32657/10356/6468openalex-snapshot
Applied graph- theoretic approach for two- way to one- way road network conversion
inferred← citeshttps://doi.org/10.4025/actascitechnol.v21i0.3081openalex-snapshot
An improvement for an algorithm for finding a minimum feedback arc set for planar graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.1995.92897openalex-snapshot
Cortes orientados e cortes impares em grafos
inferred← citeshttps://doi.org/10.5555/1283383.1283510openalex-snapshot
Fractional packing in ideal clutters
inferred← citeshttps://doi.org/10.5555/338219.338620openalex-snapshot
Directed network design with orientation constraints
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.