arXiv (All)
open access
An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
Braess paradox is a well-known phenomenon that originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges. The possibility of having the paradox was called vulnerability by Roughgarden in 2006 and was characterized later on by graph-theoretical notions, bo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Thresholds and Fluctuations of Submultiplexes in Random Multiplex Networks#612877
- Thresholds and Fluctuations of Submultiplexes in Random Multiplex Networks#611400
- Modeling Bipartite Dynamic Networks: An Additive and Multiplicative Effects Model#1155835
- Information geometry of perturbed gradient flow systems on hypergraphs: A perspective towards nonequilibrium physics#1052040
- An Informational Route to Negative Mobility#659334
Record · ID 1051123
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive