🌐EnglishEnglishEspañolFrançaisItalianoPolskiPortuguêsTiếng ViệtРусский日本語EntityQ2528185· pop 10· linked from 37 articlessubgraph isomorphism problemthe NP-complete problem of testing whether one graph is a subgraph of anotherAvailable in 10 languagesEspañolFrançaisРусскийPortuguêsItalianoPolskiSerbianTiếng ViệtUkrainianConnectionsplanar graphEntityArtificial intelligenceConceptCategoriesComputational problems in graph theoryGraph algorithmsNP-complete problems