An exact algorithm for a core/periphery bipartitioning problem

Social Networks

Volumn 33, Issue 1, 2011, Pages 12-19

  Brusco, Michael ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

Bipartition; Branch and bound; Core periphery; Exact algorithm

Indexed keywords

EID: 79251640399     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.socnet.2010.08.002     Document Type: Article

References (24)

1. Aarts, E., Korst, J., 1989. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, New York.
2. Baker D.R. A structural analysis of the social work journal network: 1985-1986. Journal of Social Service Research 1992, 15:153-168.
3. Borgatti S.P., Everett M.G. Models of core/periphery structures. Social Networks 1999, 21:375-395.
4. Borgatti, S.P., Everett, M.G., Freeman, L.C., 2002. Ucinet for Windows, Version 6.153: Software for Social Network Analysis. Analytic Technologies, Harvard, MA.
5. Boyd J.P., Fitzgerald W.J., Beck R.J. Computing core/periphery structures and permutation tests for social relations data. Social Networks 2006, 28(2):165-178.
6. Boyd J.P., Fitzgerald W.J., Mahutga M.C., Smith D.A. Computing continuous core/periphery structures for social relations data with MINRES/SVD. Social Networks 2010, 32:125-137.
7. Brusco M.J., Cradit J.D. Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices. Journal of Mathematical Psychology 2004, 48(5):301-309.
8. Brusco M., Doreian P., Mrvar A., Steinley D. Linking theory, models, and data to understand social network phenomena: two algorithms for relaxed structural balance partitioning. Sociological Methods & Research 2011, 40(1).
9. Brusco M.J., Stahl S. An interactive approach to multiobjective combinatorial data analysis. Psychometrika 2001, 66(1):5-24.
10. Brusco M.J., Stahl S. Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming. Psychometrika 2005, 70(2):253-270.
11. Brusco M.J., Stahl S. Branch-and-Bound Applications in Combinatorial Data Analysis 2005, Springer, New York.
12. Brusco M.J., Steinley D. K-balance partitioning: An exact method with application to generalized structural balance and other psychological contexts. Psychological Methods 2010, 15(2):145-157.
13. Doreian P., Batagelj V., Ferligoj A. Generalized Blockmodeling 2005, Cambridge University Press, Cambridge, UK.
14. Everett M.G., Borgatti S.P. Peripheries of cohesive subsets. Social Networks 1999, 21(4):397-407.
15. Everett M.G., Borgatti S.P. Extending centrality. Models and Methods in Social Network Analysis 2005, 57-76. Cambridge University Press, New York. P.J. Carrington, J. Scott, S. Wasserman (Eds.).
16. Garcia Muniz A.S., Ramos Carvajal C. Core/periphery structure models: an alternative proposal. Social Networks 2006, 28(4):442-448.
17. Goldberg D.E. Genetic Algorithms 1989, Addison-Wesley, New York.
18. Groenen P.J.F., Heiser W.J. The tunneling method for global optimization in multidimensional scaling. Psychometrika 1996, 61:529-550.
19. Hansen P., Delattre M. Complete-link cluster analysis by graph coloring. Journal of the American Statistical Association 1978, 73:397-403.
20. Kernighan B.W., Lin S. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 1970, 49:221-226.
21. Klein G., Aronson J.E. Optimal clustering: a model and method. Naval Research Logistics 1991, 38:447-461.
22. Koontz W.L.G., Narendra P.M., Fukunaga K. A branch and bound clustering algorithm. IEEE Transactions on Computing 1975, C-24:908-915.
23. Palubeckis G. A branch-and-bound approach using polyhedral results for a clustering problem. INFORMS Journal on Computing 1997, 9(1):30-42.
24. Wasserman S., Faust K. Social Network Analysis: Methods and Applications 1994, Cambridge University Press, Cambridge.