Go to the corresponding OASIcs Volume Portal 
Matsubayashi, Akira ; Saito, Yushi
pdfformat: 

@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:112:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {9783959773027}, ISSN = {21906807}, year = {2023}, volume = {115}, editor = {Frigioni, Daniele and Schiewe, Philine}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18773}, URN = {urn:nbn:de:0030drops187738}, doi = {10.4230/OASIcs.ATMOS.2023.12}, annote = {Keywords: Braess’s paradox, seriesparallel graph, routeinduced graph, Nash flow} }
Keywords:  Braess’s paradox, seriesparallel graph, routeinduced graph, Nash flow  
Collection:  23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)  
Issue Date:  2023  
Date of publication:  31.08.2023 