A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs

Pietro Cenciarelli, Daniele Gorla, Ivano Salvo. A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs. Algorithmica, 81(4):1535-1560, 2019. [doi]

Authors

Pietro Cenciarelli

This author has not been identified. Look up 'Pietro Cenciarelli' in Google

Daniele Gorla

This author has not been identified. Look up 'Daniele Gorla' in Google

Ivano Salvo

This author has not been identified. Look up 'Ivano Salvo' in Google