@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}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode