Linear tolls suffice: New bounds and algorithms for tolls in single source networks

We give a simple example to demonstrate that if the graph is not series parallel, then the set of paths traveled by users in the Nash flow depends critically on the distribution of users' valuations of time.