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]

@article{CenciarelliGS19,
  title = {A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs},
  author = {Pietro Cenciarelli and Daniele Gorla and Ivano Salvo},
  year = {2019},
  doi = {10.1007/s00453-018-0486-6},
  url = {https://doi.org/10.1007/s00453-018-0486-6},
  researchr = {https://researchr.org/publication/CenciarelliGS19},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {81},
  number = {4},
  pages = {1535-1560},
}