Polynomial recognition of vulnerable multi-commodities

DOI10.1016/j.ipl.2022.106282OpenAlexW4225405755MaRDI QIDQ2094357

Dario Fiorenza, Daniele Gorla, Ivano Salvo

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106282

zbMATH Keywords

graph theorygraph algorithmstraffic networksbraess paradox

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Network characterizations for excluding Braess's paradox
• Network topology and the efficiency of equilibrium
• Inefficiencies in network models: a graph-theoretic perspective
• A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Excluding Braess’s Paradox in Nonatomic Selfish Routing
• Über ein Paradoxon aus der Verkehrsplanung

This page was built for publication: Polynomial recognition of vulnerable multi-commodities