Clique (graph theory)
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.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Clique (graph theory)
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.
has abstract
Een clique is, in de grafenthe ...... soon elke andere persoon kent.
@nl
Eine Clique bezeichnet in der ...... ch schwierig (NP-vollständig).
@de
En teoría de grafos, un clique ...... ndiente del grafo complemento.
@es
In teoria dei grafi, una cricc ...... icolarmente in bioinformatica.
@it
In the mathematical area of gr ...... articularly in bioinformatics.
@en
Klika – podgraf, w którym każd ...... t problem zbioru niezależnego.
@pl
Na área da matemática da teori ...... ncipalmente na bioinformática.
@pt
Une clique d'un graphe non ori ...... est un problème NP-difficile.
@fr
В теории графов кликой неориен ...... в частности, в биоинформатике.
@ru
グラフ理論において、無向グラフ のクリーク（英: cliqu ...... 。 グラフ の最大クリークは理論上重要であり、 で表される。
@ja
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
740,054,718
title
urlname
subject
hypernym
comment
Een clique is, in de grafenthe ...... soon elke andere persoon kent.
@nl
Eine Clique bezeichnet in der ...... ch schwierig (NP-vollständig).
@de
En teoría de grafos, un clique ...... ño particular, es NP-completo.
@es
In teoria dei grafi, una cricc ...... ella cricca, ed è NP-completo.
@it
In the mathematical area of gr ...... ing cliques have been studied.
@en
Klika – podgraf, w którym każd ...... skonałym (ang. perfect graph).
@pl
Na área da matemática da teori ...... ontrar clique foram estudados.
@pt
Une clique d'un graphe non ori ...... lique sont toujours adjacents.
@fr
В теории графов кликой неориен ...... гие алгоритмы для поиска клик.
@ru
グラフ理論において、無向グラフ のクリーク（英: cliqu ...... 。 グラフ の最大クリークは理論上重要であり、 で表される。
@ja
label
Clique (Graphentheorie)
@de
Clique (grafentheorie)
@nl
Clique (graph theory)
@en
Clique (théorie des graphes)
@fr
Clique
@es
Clique
@pt
Cricca (teoria dei grafi)
@it
Klika (teoria grafów)
@pl
Клика (теория графов)
@ru
クリーク (グラフ理論)
@ja
