A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Crossref DOI link: https://doi.org/10.1007/s00453-018-0486-6
Published Online: 2018-07-23
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Cenciarelli, Pietro
Gorla, Daniele http://orcid.org/0000-0001-8859-9844
Salvo, Ivano http://orcid.org/0000-0003-3111-701X
Text and Data Mining valid from 2018-07-23
Article History
Received: 19 December 2016
Accepted: 17 July 2018
First Online: 23 July 2018