Resilience of Traffic Networks under Non-Equilibrium Learning

The dataset used in the paper is a transportation network, which is a directed, finite, and connected graph G = (V, E) without self-loops. The vertices V represent road junctions, and the edges E represent road segments. The set of distinct origin-destination (OD) pairs is W ⊆ V × V, indexed by w, with cardinality W.

Data and Resources

Cite this as

Yunian Pan, Tao Li, Quanyan Zhu (2024). Dataset: Resilience of Traffic Networks under Non-Equilibrium Learning. https://doi.org/10.57702/w5dyl3my

DOI retrieved: December 16, 2024

Additional Info

Field Value
Created December 16, 2024
Last update December 16, 2024
Defined In https://doi.org/10.48550/arXiv.2210.03214
Author Yunian Pan
More Authors
Tao Li
Quanyan Zhu