Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments

Takehiro Inohara. Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments. Applied Mathematics and Computation, 133(1):93-104, 2002. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.