Deciding whether a grid is a topological subgraph of a planar graph is NP-complete.

Andrea Jiménez Tina Janne Schmidt

Published in: Discret. Math. (2020)

Keyphrases

np complete
planar graphs
np hard
computational complexity
optimal solution
lower bound
special case
approximate inference
image segmentation
higher order
minimum weight