Login / Signup
Strengthening Hardness Results to 3-Connected Planar Graphs.
Giordano Da Lozzo
Ignaz Rutter
Published in:
CoRR (2016)
Keyphrases
</>
planar graphs
computational complexity
np complete
connected components
phase transition
image segmentation
approximate inference
minimum weight
np hard
least squares
worst case