12 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 4 cited
A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Pietro Cenciarelli, Daniele Gorla, Ivano Salvo
A directed multigraph is said vulnerable if it can generate Braess paradox in Traffic Networks. In this paper, we give a graph-theoretic characterisation of vulnerable directed mul…
cs.DM2016★ 12 cited
Graph Theoretic Investigations on Inefficiencies in Network Models
Pietro Cenciarelli, Daniele Gorla, Ivano Salvo
We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in f…