An algorithm for planarity testing by adjacency matrix.

Shi-Qun Li Qian-Li Ma

Published in: ICMLC (2012)

Keyphrases

np hard
dynamic programming
k means
probabilistic model
adjacency matrix
computational complexity
worst case
matching algorithm
image processing
optimal solution
lower bound
tree structure