Prev: problem on compiling exe containing dll file
Next: using non-standard serial port baud rate (interfacing to SICK LIDAR)
From: Ahmad on 7 May 2008 15:20
Hi there,

I want to find all the sets of nodes in a graph which have
edges between all the nodes in the set....in other words I
want to find all the complete sub-graphs in an
un-directional graph: e.g.

If I have this upper-triangular graph (un-directed graph)
where each
edge is denoted by a 1 (0 is no edge) ... e.g. C is
connected to D:
A B C D E F
A X 1 1 0 0 0
B X X 1 0 0 0
C X X X 1 0 1
D X X X X 0 1
E X X X X X 0
F X X X X X X

If I give the algo this matrix, it should return me two
answer sets -> (A,B,C) and (C,D,F).

Am I looking for finding cliques? If so what is the fastest
way known to compute these quickly? Anybody implemented this
on Matlab? What is the most standard easiest way to compute
these sets. I have heard cliques are 3-SAT (NP complete)?

Please help!!

Thanks
 | 
Pages: 1
Prev: problem on compiling exe containing dll file
Next: using non-standard serial port baud rate (interfacing to SICK LIDAR)