Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q761631> ?p ?o }
Showing triples 1 to 82 of
82
with 100 triples per page.
- Q761631 subject Q6465276.
- Q761631 abstract "In the mathematical area of graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph, such that its induced subgraph is complete; that is, every two distinct vertices in the clique are adjacent. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Cliques have also been studied in computer science: the task of finding whether there is a clique of a given size in a graph (the clique problem) is NP-complete, but despite this hardness result, many algorithms for finding cliques have been studied.Although the study of complete subgraphs goes back at least to the graph-theoretic reformulation of Ramsey theory by Erdős & Szekeres (1935), the term clique comes from Luce & Perry (1949), who used complete subgraphs in social networks to model cliques of people; that is, groups of people all of whom know each other. Cliques have many other applications in the sciences and particularly in bioinformatics.".
- Q761631 thumbnail VR_complex.svg?width=300.
- Q761631 wikiPageExternalLink fm15126.pdf.
- Q761631 wikiPageExternalLink karp.pdf.
- Q761631 wikiPageExternalLink 1935-01.pdf.
- Q761631 wikiPageExternalLink 1.pdf.
- Q761631 wikiPageWikiLink Q1047749.
- Q761631 wikiPageWikiLink Q1060343.
- Q761631 wikiPageWikiLink Q1096734.
- Q761631 wikiPageWikiLink Q1101814.
- Q761631 wikiPageWikiLink Q1128435.
- Q761631 wikiPageWikiLink Q1146531.
- Q761631 wikiPageWikiLink Q1187620.
- Q761631 wikiPageWikiLink Q1196873.
- Q761631 wikiPageWikiLink Q128570.
- Q761631 wikiPageWikiLink Q131476.
- Q761631 wikiPageWikiLink Q13222616.
- Q761631 wikiPageWikiLink Q1322892.
- Q761631 wikiPageWikiLink Q1336170.
- Q761631 wikiPageWikiLink Q1354987.
- Q761631 wikiPageWikiLink Q1378376.
- Q761631 wikiPageWikiLink Q141488.
- Q761631 wikiPageWikiLink Q1570441.
- Q761631 wikiPageWikiLink Q159462.
- Q761631 wikiPageWikiLink Q166507.
- Q761631 wikiPageWikiLink Q17101022.
- Q761631 wikiPageWikiLink Q17101799.
- Q761631 wikiPageWikiLink Q172861.
- Q761631 wikiPageWikiLink Q1734364.
- Q761631 wikiPageWikiLink Q2031707.
- Q761631 wikiPageWikiLink Q21198.
- Q761631 wikiPageWikiLink Q215206.
- Q761631 wikiPageWikiLink Q2329.
- Q761631 wikiPageWikiLink Q2393193.
- Q761631 wikiPageWikiLink Q242125.
- Q761631 wikiPageWikiLink Q2466732.
- Q761631 wikiPageWikiLink Q26972.
- Q761631 wikiPageWikiLink Q2715623.
- Q761631 wikiPageWikiLink Q2881060.
- Q761631 wikiPageWikiLink Q2976575.
- Q761631 wikiPageWikiLink Q3021749.
- Q761631 wikiPageWikiLink Q3085841.
- Q761631 wikiPageWikiLink Q3115592.
- Q761631 wikiPageWikiLink Q3498041.
- Q761631 wikiPageWikiLink Q3893853.
- Q761631 wikiPageWikiLink Q395.
- Q761631 wikiPageWikiLink Q43035.
- Q761631 wikiPageWikiLink Q45715.
- Q761631 wikiPageWikiLink Q4669959.
- Q761631 wikiPageWikiLink Q4915408.
- Q761631 wikiPageWikiLink Q504843.
- Q761631 wikiPageWikiLink Q5134410.
- Q761631 wikiPageWikiLink Q5134413.
- Q761631 wikiPageWikiLink Q5141281.
- Q761631 wikiPageWikiLink Q5385322.
- Q761631 wikiPageWikiLink Q547823.
- Q761631 wikiPageWikiLink Q5638117.
- Q761631 wikiPageWikiLink Q5656275.
- Q761631 wikiPageWikiLink Q584521.
- Q761631 wikiPageWikiLink Q6465276.
- Q761631 wikiPageWikiLink Q6806108.
- Q761631 wikiPageWikiLink Q7168092.
- Q761631 wikiPageWikiLink Q720459.
- Q761631 wikiPageWikiLink Q7236518.
- Q761631 wikiPageWikiLink Q7520883.
- Q761631 wikiPageWikiLink Q7840044.
- Q761631 wikiPageWikiLink Q7888149.
- Q761631 wikiPageWikiLink Q7959587.
- Q761631 wikiPageWikiLink Q835942.
- Q761631 wikiPageWikiLink Q8366.
- Q761631 wikiPageWikiLink Q837455.
- Q761631 wikiPageWikiLink Q837902.
- Q761631 wikiPageWikiLink Q896177.
- Q761631 wikiPageWikiLink Q899656.
- Q761631 wikiPageWikiLink Q902252.
- Q761631 wikiPageWikiLink Q905837.
- Q761631 wikiPageWikiLink Q913598.
- Q761631 wikiPageWikiLink Q918099.
- Q761631 comment "In the mathematical area of graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph, such that its induced subgraph is complete; that is, every two distinct vertices in the clique are adjacent. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs.".
- Q761631 label "Clique (graph theory)".
- Q761631 depiction VR_complex.svg.