Complexity results for matching cut problems in graphs without long induced paths.

Hoàng-Oanh Le Van Bang Le

Published in: CoRR (2023)

Keyphrases

graph matching
pattern matching
decision problems
pattern recognition
feature points
np complete
computational complexity
np hard
graph cuts
shortest path
graph representation
graph theoretic
relational structures