10 citations · 10 across the 1 of their papers we have counts for
1 paper
Amir Abboud, Kevin Lewi
We consider the Exact-Weight-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H, the complexity of this p…