2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs.

Erik D. Demaine Kritkorn Karntikoon Nipun Pitimanaaree

Published in: CoRR (2023)

Keyphrases

np complete
planar graphs
np hard
matching algorithm
computational complexity
image matching
feature points
phase transition
special case
connected components