1 research outputs found
Enumerating Isolated Cliques in Synthetic and Financial Networks
We do computational studies concerning the enumeration of maximal isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We perform experiments with synthetic graphs (in the Gn,m,p model) and financial networks, proposing the enumeration of isolated cliques as a useful instrument in analyzing financial networks