activity
20182026
most citedComplexity of equilibria in binary public goods games on undirected graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.CC2018

A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths

Cristina Bazgan, Till Fluschnik, André Nichterlein +2

We study the NP-hard Shortest Path Most Vital Edges problem arising in the context of analyzing network robustness. For an undirected graph with positive integer edge lengths and t…