## ← Clique Problem - Intro to Algorithms

• 3 Followers
• 11 Lines

### Get Embed Code x Embed video Use the following code to embed this video. See our usage guide for more details on embedding. Paste this in your document somewhere (closest to the closing body tag is preferable): ```<script type="text/javascript" src='https://amara.org/embedder-iframe'></script> ``` Paste this inside your HTML body, where you want to include the widget: ```<div class="amara-embed" data-url="http://www.youtube.com/watch?v=eya-cyk-7-4" data-team="udacity"></div> ``` 3 Languages

Showing Revision 3 created 05/24/2016 by Udacity Robot.

1. Okay, here's an example of a decision problem that comes up in social network analysis
2. and that's the clique problem.
3. Remember clique is a set of nodes in a network that are all pairwise connected--
4. everybody in the group knows everybody else in the group.
5. We were given a graph G and a number k, let's say 4, and we're asked--is there a clique of size k in G.
6. So remember clique is a connective set of nodes--so for example 1, 3, 4 is a three clique,
7. but now the question is--is there a four clique in the graph.
8. So just to make sure that you understand the idea of this problem,
9. why don't you find the four clique--there is a four clique in this graph.
10. Find the four clique, add the node numbers that make up the clique together,
11. and enter the answer in the box.