Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs
Keywords: تکمیل NP; Subgraph isomorphism; Graph class; Polynomial-time algorithm; NP-completeness;