*****  To join INSNA, visit  *****

Dear List,

I have a rather unusual question regarding power-sets in networks. I
would like to find all the power-sets in a network under the
constraint that the nodes are not linked together, i.e. the
calculation should happen only for set of nodes that are not neighbors
of each others.

the point is that finding all power-sets and then dropping the ones
where nodes are linked is computationally very costly, and I am in
looking for some other strategy...

does someone happen to have some suggestions or advices?

Best regards,

Simone Gabbriellini, PhD

PostDoc@DISI, University of Bologna
mobile: +39 340 39 75 626
email: [log in to unmask]

DigitalBrains srl
mobile: +39 340 39 75 626
email: [log in to unmask]

SOCNET is a service of INSNA, the professional association for social
network researchers ( To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.