On the public citation graph

On the average length of lexicographic paths

https://doi.org/10.1007/bf01580885
0 signed · 12 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/bf01580886openalex-snapshot
A note on degeneracy in linear programming
inferredcites →https://doi.org/10.1007/bf02591931openalex-snapshot
On the length of simplex paths: The assignment case

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-75639-9_99openalex-snapshot
Degeneracy Graphs — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-77254-2_8openalex-snapshot
Degeneracy in Mathematical Programming and Degeneracy Graphs — A Concise Version of A Tutorial —
inferred← citeshttps://doi.org/10.1007/bf01580886openalex-snapshot
A note on degeneracy in linear programming
inferred← citeshttps://doi.org/10.1007/bf01589397openalex-snapshot
Survey of solved and open problems in the degeneracy phenomenon
inferred← citeshttps://doi.org/10.1007/bf02096255openalex-snapshot
Selected bibliography on degeneracy
inferred← citeshttps://doi.org/10.1007/bf02096258openalex-snapshot
Degeneracy graphs: theory and application an updated survey
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90058-bopenalex-snapshot
A new pivoting rule for solving various degeneracy problems
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.018openalex-snapshot
Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm
inferred← citeshttps://doi.org/10.1017/ccol0521340446.006openalex-snapshot
On the complexity of linear programming
inferred← citeshttps://doi.org/10.5784/6-1-478openalex-snapshot
Degeneracy problems in mathematical programming and degeneracy graphs
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.