Login / Signup
Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete.
Andrea Jiménez
Tina Janne Schmidt
Published in:
LAGOS (2019)
Keyphrases
</>
np complete
planar graphs
np hard
computational complexity
minimum weight
lower bound
worst case
approximation algorithms
social networks
objective function
special case
graphical models