Chii chinonzi clique mu graph theory?
Context:Munzvimbo yemasvomhu yegrafu dzidziso, clique iseti yemakona egrafu isina kutungamirwa yakadai kuti makona maviri akasiyana ari mu clique ari pedyo. Ndokunge, chikwata chegirafu G igirafu duku rakakonzerwa raG rakakwana. Ma clique ndeimwe yemashoko ekutanga e graph theory uye anoshandiswa mune mamwe matambudziko akawanda emasvomhu uye zvivakwa pamagrafu. Mapoka akaongororwawo mu computer science: basa rokuwana kana pane mapoka ehukuru hwakapiwa mugirafu (the clique problem) iri NP-yakakwana, asi pasinei nemugumisiro uyu wakaoma, many algorithms ekuwana mapoka akaongororwa.  Kunyange zvazvo kudzidza subgraphs zvakakwana anodzokera kanenge kuti girafu-theoretic reformulation pamusoro Ramsey dzidziso kubudikidza Erdős & Szekeres (1935), rokuti clique kunobva Luce & Perry (1949), uyo akashandisa subgraphs zvakakwana mumagariro network kuti muenzaniso cliques vanhu; ndiko kuti, mapoka evanhu vose vanoziva mumwe nomumwe. Mapoka ane zvimwe zvinoshandiswa zvakawanda muzvesayenzi uye zvikurukuru mubioinformatics.
Mu graph theory, clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. Mu graph theory, clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. Mu graph theory, clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent.