```*****  To join INSNA, visit http://www.insna.org  *****

maybe a rough example can clarify what I would like to achieve... take
a first network A, with nodes={a,b,c} and no links, then possible
power-sets are of course:
a
b
c
ab
ac
bc
abc

take a second network B, with nodes={a,b,c} and one link={a<->b}, then
possible solutions to my problem, let's call them "conflict-free"
sets, are:
a
b
c
ac
bc

Best,
Simo

>
> <<<-------- Simone Gabbriellini-------->>>
>> *****  To join INSNA, visit http://www.insna.org  *****
>>
>> 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...
>
>   It should be relatively easy to write a procedure to generate / list
>   all the required sets. But there can be many - I guess that their
>   number is growing exponentially with the size of network. Therefore
>   this approach is feasible only for very small networks (some tens -
>   may be up to 30 nodes).
>
>   There is another question - should the sets be maximal in the sense
>   that they are not contained in any other set that satisfies the
>   constraints. In other words are the sets that contain a single
>   node also solutions ?
>
> --
> Vladimir Batagelj, University of Ljubljana, FMF, Department of Mathematics
>   Jadranska 19, 1000 Ljubljana, Slovenia
>

--
Simone Gabbriellini, PhD

PostDoc@DISI, University of Bologna
mobile: +39 340 39 75 626
home: www.digitaldust.it

DigitalBrains srl
Amministratore
mobile: +39 340 39 75 626