Home›Computational problems in graph theory›مسئله بزرگترین خوشه🌐فارسیEnglishDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsРусскийالعربيةفارسیไทย한국어中文日本語EntityQ1196873· pop 18· linked from 64 articlesمسئله بزرگترین خوشهAlso known as maximum clique problemcomputational problem of finding cliques in a graphAvailable in 18 languagesEspañolFrançaisDeutsch中文日本語РусскийPortuguêsItalianoالعربيةBanglaConnectionsglossary of graph theory termsEntityP versus NP problemEntityCategoriesComputational problems in graph theoryNP-complete problems