Graph matching problems and the NP-hardness of sortedness constraints
Keywords: تطابق نمودار; Computational complexity; Graph matching; Bipartite graph; Constraint programming; Sortedness constraints;