***** To join INSNA, visit http://www.insna.org *****
You might want to consider the following papers on the partitioning of signed networks:
Andrej Mrvar and Patrick Doreian
(2009), “Partitioning Signed Two-Mode Networks”, Journal of Mathematical Sociology, 33: 196-221.
Patrick Doreian and Andrej Mrvar (2009) “Partitioning Signed Social Networks”, Social Networks, Vol. 31: 1-11.
Doreian and A. Mrvar, "A Partitioning Approach to Structural Balance", Social Networks, Vol. 18, 1996, pp. 149-168
All of these partitioning approached have been implemented in Pajek
Dear SOCNET members,
In social network analysis, a signed graph is clusterable if it can be partitioned into three or more clusters such that all positive ties are within the clusters and all negative ties are situated between clusters. Note, this is in contrast to balance, whereby a signed graph is balanced if it can be partitioned into two clusters (one of which may be empty) such that all positive ties are within the clusters and all negative ties are situated between clusters. In other words, clusterability is the more general model in terms of which balance is a special case
I would be grateful if anyone can inform me about the first appearance of a clusterability procedure or algorithm in the network (or graph theory) literature.