On the public citation graph

Encoding Path Sets in Acyclic Subgraphs

https://doi.org/10.2139/ssrn.4673353
0 signed · 22 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/9781118903032openalex-extracted
Transportation Network Analysis
inferredcites →https://doi.org/10.1007/978-3-031-10515-9openalex-extracted
Feedback Arc Set
inferredcites →https://doi.org/10.1007/s00778-020-00604-xopenalex-extracted
Finding k-shortest paths with limited overlap
inferredcites →https://doi.org/10.1016/0020-0190(96)00075-0openalex-extracted
Maintaining a topological order under edge insertions
inferredcites →https://doi.org/10.1016/0041-1647(71)90012-8openalex-extracted
A probabilistic multipath traffic assignment model which obviates path enumeration
inferredcites →https://doi.org/10.1016/0191-2615(80)90004-1openalex-extracted
Some developments in equilibrium traffic assignment
inferredcites →https://doi.org/10.1016/0191-2615(95)00005-xopenalex-extracted
Alternatives to Dial's logit assignment algorithm
inferredcites →https://doi.org/10.1016/j.trb.2019.02.002openalex-extracted
Prism-based path set restriction for solving Markovian traffic assignment problem
inferredcites →https://doi.org/10.1016/j.trb.2021.10.013openalex-extracted
Markovian traffic equilibrium assignment based on network generalized extreme value model
inferredcites →https://doi.org/10.1016/j.trc.2023.104014openalex-extracted
Capturing positive network attributes during the estimation of recursive logit models: A prism-based approach
inferredcites →https://doi.org/10.1016/s0191-2615(96)00035-5openalex-extracted
Curbing the computational difficulty of the logit equilibrium assignment model
inferredcites →https://doi.org/10.1016/s1755-5345(13)70005-8openalex-extracted
Route choice modeling: past, present and future research directions
inferredcites →https://doi.org/10.1061/(asce)0733-947x(2010)136:1(52)openalex-extracted
Origin-Based Partial Linearization Method for the Stochastic User Equilibrium Traffic Assignment Problem
inferredcites →https://doi.org/10.1080/03081061003643705openalex-extracted
An improved Dial's algorithm for logit-based traffic assignment within a directed acyclic network
inferredcites →https://doi.org/10.1111/mice.12781openalex-extracted
Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set
inferredcites →https://doi.org/10.1137/0204007openalex-extracted
Finding All the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1145/2756553openalex-extracted
A New Approach to Incremental Cycle Detection and Related Problems
inferredcites →https://doi.org/10.1287/trsc.11.3.253openalex-extracted
On Stochastic Models of Traffic Assignment
inferredcites →https://doi.org/10.1287/trsc.31.4.349openalex-extracted
Decomposition of Path Choice Entropy in General Transport Networks
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-extracted
The Art of Computer Programming
inferredcites →https://doi.org/10.1680/ipeds.1952.11259openalex-extracted
ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.
inferredcites →https://doi.org/10.21105/joss.04593openalex-extracted
dyntapy: dynamic and static traffic assignment in Python
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.