Attacking Shortest Paths by Cutting Edges
Attacking Shortest Paths by Cutting Edges
Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that can manipulate the graph structure could alter traffic patterns to gain some benefit (e.g., make more money by directing traffic to a toll …