@InProceedings{matsubayashi_et_al:OASIcs.ATMOS.2023.12,
author = {Matsubayashi, Akira and Saito, Yushi},
title = {{A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess’s Paradox}},
booktitle = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)},
pages = {12:1--12:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-302-7},
ISSN = {2190-6807},
year = {2023},
volume = {115},
editor = {Frigioni, Daniele and Schiewe, Philine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2023.12},
URN = {urn:nbn:de:0030-drops-187738},
doi = {10.4230/OASIcs.ATMOS.2023.12},
annote = {Keywords: Braess’s paradox, series-parallel graph, route-induced graph, Nash flow}
}