IDEAS home Printed from https://ideas.repec.org/r/spr/psycho/v15y1950i2p169-190.html

Connectivity and generalized cliques in sociometric group structure

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
  2. Dimitrios Tsiotas & Serafeim Polyzos, 2018. "The Complexity in the Study of Spatial Networks: an Epistemological Approach," Networks and Spatial Economics, Springer, vol. 18(1), pages 1-32, March.
  3. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
  4. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 0. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 0, pages 1-12.
  5. Foad Mahdavi Pajouh & Zhuqi Miao & Balabhaskar Balasundaram, 2014. "A branch-and-bound approach for maximum quasi-cliques," Annals of Operations Research, Springer, vol. 216(1), pages 145-161, May.
  6. Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
  7. Vincent Labatut & Jean-Michel Balasque, 2012. "Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application," Post-Print hal-00633653, HAL.
  8. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 2018. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 20(5), pages 1041-1052, October.
  9. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
  10. Yuichi Asahiro & Tomohiro Kubo & Eiji Miyano, 2019. "Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 143-161, October.
  11. Balabhaskar Balasundaram & Sergiy Butenko & Illya V. Hicks, 2011. "Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem," Operations Research, INFORMS, vol. 59(1), pages 133-142, February.
  12. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
  13. Balabhaskar Balasundaram & Sergiy Butenko & Svyatoslav Trukhanov, 2005. "Novel Approaches for Analyzing Biological Networks," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 23-39, August.
  14. Richard D. Alba & Gwen Moore, 1978. "Elite Social Circles," Sociological Methods & Research, , vol. 7(2), pages 167-188, November.
  15. Korotaev, Andrey (Коротаев, Андрей) & Shulgin, Sergey (Шульгин, Сергей) & Zinkina, Yulia (Зинькина, Юлия), 2017. "Country Risk Analysis Based on Demographic and Socio-Economic Data [Анализ Страновых Рисков С Использованием Демографических И Социально-Экономических Данных]," Working Papers 031715, Russian Presidential Academy of National Economy and Public Administration.
  16. Maciej Rysz & Foad Mahdavi Pajouh & Pavlo Krokhmal & Eduardo L. Pasiliao, 2018. "Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights," Annals of Operations Research, Springer, vol. 262(1), pages 89-108, March.
  17. Richard C. Roistacher, 1974. "A Review of Mathematical Methods in Sociometry," Sociological Methods & Research, , vol. 3(2), pages 123-171, November.
  18. Balasundaram, Balabhaskar & Borrero, Juan S. & Pan, Hao, 2022. "Graph signatures: Identification and optimization," European Journal of Operational Research, Elsevier, vol. 296(3), pages 764-775.
  19. Yajun Lu & Hosseinali Salemi & Balabhaskar Balasundaram & Austin Buchanan, 2022. "On Fault-Tolerant Low-Diameter Clusters in Graphs," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3181-3199, November.
  20. Foad Mahdavi Pajouh & Esmaeel Moradi & Balabhaskar Balasundaram, 2017. "Detecting large risk-averse 2-clubs in graphs with random edge failures," Annals of Operations Research, Springer, vol. 249(1), pages 55-73, February.
  21. Zhuqi Miao & Balabhaskar Balasundaram, 2020. "An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 763-778, July.
  22. Vladimir Boginski & Sergiy Butenko & Oleg Shirokikh & Svyatoslav Trukhanov & Jaime Gil Lafuente, 2014. "A network-based data mining approach to portfolio selection via weighted clique relaxations," Annals of Operations Research, Springer, vol. 216(1), pages 23-34, May.
  23. Jessop, Alan, 2003. "Blockmodels with maximum concentration," European Journal of Operational Research, Elsevier, vol. 148(1), pages 56-64, July.
  24. Stephen P. Borgatti & Daniel S. Halgin, 2011. "On Network Theory," Organization Science, INFORMS, vol. 22(5), pages 1168-1181, October.
  25. Köppl, Stefan & Köppl-Turyna, Monika & Christopoulos, Dimitris, 2025. "The performance of government-backed venture capital investments," Research Policy, Elsevier, vol. 54(8).
  26. Pattillo, Jeffrey & Youssef, Nataly & Butenko, Sergiy, 2013. "On clique relaxation models in network analysis," European Journal of Operational Research, Elsevier, vol. 226(1), pages 9-18.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.