Clique problem
Clique problem In computational complexity theory, the clique problem is a graph-theoretical NP-complete problem. The problem was not only one ...
http://en.wikipedia.org/wiki/Clique_problem - 5k - Cached - Similar pages

Talk:Clique problem
Talk:Clique problem I thought a clique was a fully connected sub-graph? The ... is described here makes me think a clique is two adjacent vertices... --Bryanlharris 19:21 ... I propose we move this to maximum clique problem, which is a commonly used ...
http://en.wikipedia.org/wiki/Talk:Clique_problem - 2k - Cached - Similar pages

Problem of clique   (translated from Spanish)
Problem of clique In Computation, problem of the Clique or problem of the league of friends is ...
http://es.wikipedia.org/wiki/Problema_de_la_clique - 2k - Cached (Spanish) - Wikipedia (Spanish) - Similar pages

Click   (translated from French)
... clicks of maximum size is a traditional problem of theory of complexity.
http://fr.wikipedia.org/wiki/Clique - 0k - Cached (French) - Wikipedia (French) - Similar pages

Academic clique   (translated from Japanese)
Academic clique Academic clique(く occasion) with, school of specification, university ... are times when it is called academic clique from the third party. In case of ... owner president and being influenced by academic clique and the like of the top at ... the police, from Self Defense Force, academic clique is not unusual even in scientific ...
http://ja.wikipedia.org/wiki/学閥 - 11k - Cached (Japanese) - Wikipedia (Japanese) - Similar pages

Constraint satisfaction dual problem
Constraint satisfaction dual problem The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain ... and join trees of a constraint satisfaction problem are graphs representing its dual problem ...
http://en.wikipedia.org/wiki/Constraint_satisfaction_dual_problem - 40k - Cached - Similar pages

Largest creek problem   (translated from Japanese)
Largest creek problem Largest creek problem(Occasion is to be, the chestnut - the ... the branch between optional two apexes) the problem which finds largest ones among them. NP difficulty . As for this problem,Assistant graphIt confronts largest independent gathering problem and equivalence. approximate algorithm it is ...
http://ja.wikipedia.org/wiki/最大クリーク問題 - 1k - Cached (Japanese) - Wikipedia (Japanese) - Similar pages

Chinese military clique   (translated from Korean)
Chinese military clique This document waits comes to fill toe ... is used from expression of the military clique" attention back Military cliqueWith Japan Military clique (army chu) In order to classify with the back crisis Chinese military clique It put an item. North ocean military clique of Beijing area Talk the military ...
http://ko.wikipedia.org/wiki/중국_군벌 - 12k - Cached (Korean) - Wikipedia (Korean) - Similar pages

Graph isomorphism problem
Graph isomorphism problem In computational complexity theory, the graph isomorphism problem or GI problem is the graph theory problem of determining whether, given two graphs G ... isomorphism. Put another way, the graph isomorphism problem asks whether two graphs can be ...
http://en.wikipedia.org/wiki/Graph_isomorphism_problem - 9k - Cached - Similar pages

Clique (graph theory)
Clique (graph theory) K 5 , a complete graph ... the vertices in that subgraph form a clique of size 5. In graph theory, a clique in an undirected graph G, is a ... a complete graph. The size of a clique is the number of vertices it contains ... within a graph can be a hard problem. Finding the largest clique in any ...
http://en.wikipedia.org/wiki/Clique_(graph_theory) - 1k - Cached - Similar pages