K-Size Subgraphs

Question

I need an algorithm to find k-size subgraphs of a large graph. What is your suggestion?

Note: My graph is undirected.

Thanks in advance.

score 0 · Answer 1 · answered Jun 17 '12 at 15:41

If you pick any k vertexes from a large graph you can make a sub-graph by selecting only those vertexes and the edges connecting them, if any.

If you want your k vertexes to be connected, you could pick k connected vertexes from a connected component of the large graph - see http://en.wikipedia.org/wiki/Connected_component_%28graph_theory%29

If you actually want k vertexes such that each vertex has an edge linking it to each of the other k-1 vertexes, then you need to know that this is called a clique, and finding this is a hard problem - see http://en.wikipedia.org/wiki/Clique_%28graph_theory%29

Hi, my problem is a click problem. I would like to learn it's clear solution because I need it's implementation. — iremce, Jun 17 '12 at 15:52

score 0 · Answer 2 · answered Jun 17 '12 at 19:12

0

A very simple way to do this is to perform a BFS or a DFS for K iteration.

answered Jun 17 '12 at 19:12

Mark

1,100
9
17

K-Size Subgraphs

2 Answers2