6 citations · 11 across the 3 of their papers we have counts for
1 paper · 1 filter
Peter Fulla, Stanislav Zivny
We study the computational complexity of planar valued constraint satisfaction problems (VCSPs), which require the incidence graph of the instance be planar. First, we show that in…