{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:55:28Z","timestamp":1777492528878,"version":"3.51.4"},"publisher-location":"New York, NY","reference-count":51,"publisher":"Springer New York","isbn-type":[{"value":"9781493971305","type":"print"},{"value":"9781493971312","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4939-7131-2_310","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:21:24Z","timestamp":1528744884000},"page":"1739-1751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pajek and PajekXXL"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Batagelj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrej","family":"Mrvar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"310_CR161","doi-asserted-by":"crossref","unstructured":"Ahmed A, Batagelj V, Fu X, Hong S-H, Merrick D, Mrvar A (2007) Visualisation and analysis of the Internet movie database. In: Asia-Pacific symposium on visualisation 2007, Sydney, Australia, 5\u20137 February 2007 (IEEE Cat. No. 07EX1615), pp 17\u201324","DOI":"10.1109\/APVIS.2007.329304"},{"key":"310_CR162","unstructured":"Batagelj V (1987) Data structure graph. Eight Yugoslav seminar on graph theory, Novi Sad, 17\u201318 Apr 1987. Institute of Mathematics, Novi Sad, p 4"},{"issue":"1","key":"310_CR163","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/0022250X.1994.9990135","volume":"19","author":"V Batagelj","year":"1994","unstructured":"Batagelj V (1994) Semirings for social networks analysis. J Math Sociol 19(1):53\u201368","journal-title":"J Math Sociol"},{"key":"310_CR164","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0378-8733(96)00297-3","volume":"19","author":"V Batagelj","year":"1997","unstructured":"Batagelj V (1997) Notes on blockmodeling. Soc Netw 19:143\u2013155","journal-title":"Soc Netw"},{"key":"310_CR165","unstructured":"Batagelj V (2003) Efficient algorithms for citation network analysis. http:\/\/arxiv.org\/abs\/cs.DL\/0309023"},{"issue":"3 Part 2","key":"310_CR166","doi-asserted-by":"publisher","first-page":"036113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj V, Brandes U (2005) Efficient generation of large random networks. Phys Rev E 71(3 Part 2):036113, 1\u20135","journal-title":"Phys Rev E"},{"issue":"3","key":"310_CR167","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s11192-012-0940-1","volume":"96","author":"V Batagelj","year":"2013","unstructured":"Batagelj V, Cerin\u0161ek M (2013) On bibliographic networks. Scientometrics 96(3):845\u2013864","journal-title":"Scientometrics"},{"issue":"2","key":"310_CR168","first-page":"47","volume":"21","author":"V Batagelj","year":"1998","unstructured":"Batagelj V, Mrvar A (1998) Pajek: a program for large network analysis. Connections 21(2):47\u201357","journal-title":"Connections"},{"key":"310_CR169","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0378-8733(00)00023-X","volume":"22","author":"V Batagelj","year":"2000","unstructured":"Batagelj V, Mrvar A (2000) Some analyses of Erd\u00f6s collaboration graph. Soc Netw 22:173\u2013186","journal-title":"Soc Netw"},{"issue":"3","key":"310_CR1610","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0378-8733(01)00035-1","volume":"23","author":"V Batagelj","year":"2001","unstructured":"Batagelj V, Mrvar A (2001) A subquadratic triad census algorithm for large sparse networks with small maximum degree. Soc Netw 23(3):237\u2013243","journal-title":"Soc Netw"},{"key":"310_CR1611","unstructured":"Batagelj V, Mrvar A (2003) Density based approaches to network analysis: analysis of Reuters terror news network. In: Workshop on link analysis for detecting complex behavior (LinkKDD2003), Washington, DC, 27 Aug 2003. http:\/\/www-2.cs.cmu.edu\/~dunja\/LinkKDD2003\/papers\/Batagelj.pdf"},{"issue":"2","key":"310_CR1612","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1177\/0894439307299587","volume":"26","author":"V Batagelj","year":"2008","unstructured":"Batagelj V, Mrvar A (2008) Analysis of kinship relations with Pajek. Soc Sci Comput Rev 26(2):224\u2013246","journal-title":"Soc Sci Comput Rev"},{"issue":"1","key":"310_CR1613","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0330-4","volume":"6","author":"V Batagelj","year":"2016","unstructured":"Batagelj V, Praprotnik S (2016) An algebraic approach to temporal network analysis based on temporal quantities. Soc Netw Anal Min 6(1):1\u201322","journal-title":"Soc Netw Anal Min"},{"issue":"3\u20135","key":"310_CR1614","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.disc.2005.09.051","volume":"307","author":"V Batagelj","year":"2007","unstructured":"Batagelj V, Zaver\u0161nik M (2007) Short cycle connectivity. Discret Math 307(3\u20135):310\u2013318","journal-title":"Discret Math"},{"issue":"2","key":"310_CR1615","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj V, Zaver\u0161nik M (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5(2):129\u2013145","journal-title":"Adv Data Anal Classif"},{"issue":"1\u20132","key":"310_CR1616","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0378-8733(92)90016-Z","volume":"14","author":"V Batagelj","year":"1992","unstructured":"Batagelj V, Doreian P, Ferligoj A (1992a) An optimizational approach to regular equivalence. Soc Netw 14(1\u20132):121\u2013135","journal-title":"Soc Netw"},{"issue":"1\u20132","key":"310_CR1617","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0378-8733(92)90014-X","volume":"14","author":"V Batagelj","year":"1992","unstructured":"Batagelj V, Ferligoj A, Doreian P (1992b) Direct and indirect methods for structural equivalence. Soc Netw 14(1\u20132):63\u201390","journal-title":"Soc Netw"},{"key":"310_CR1618","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-46648-7_9","volume-title":"Graph Drawing","author":"Vladimir Batagelj","year":"1999","unstructured":"Batagelj V, Mrvar A, Zaver\u0161nik M (1999) Partitioning approach to visualization of large graphs. In: Graph drawing, 1999, Sti\u0159in Castle, Czech Republic, September 1999. Lecture notes in computer science, vol 1731\/1999. Springer, Berlin, Heidelberg, pp 90\u201397"},{"key":"310_CR1619","doi-asserted-by":"publisher","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp. https:\/\/doi.org\/10.1088\/1742\u20135468\/2008\/10\/P10008","DOI":"10.1088\/1742\u20135468\/2008\/10\/P10008"},{"key":"310_CR1620","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1177\/0049124110384947","volume":"40","author":"M Brusco","year":"2011","unstructured":"Brusco M, Doreian P, Mrvar A, Steinley D (2011) Two algorithms for relaxed structural balance partitioning: linking theory, models, and data to understand social network phenomena. Sociol Methods Res 40:57\u201387","journal-title":"Sociol Methods Res"},{"key":"310_CR1621","doi-asserted-by":"crossref","DOI":"10.4159\/9780674029095","volume-title":"Structural holes. The social structure of competition","author":"RS Burt","year":"1992","unstructured":"Burt RS (1992) Structural holes. The social structure of competition. Harvard University Press, Cambridge"},{"key":"310_CR1622","volume-title":"Introduction to algorithms","author":"T Cormen","year":"1990","unstructured":"Cormen T, Leiserson C, Rivest R (1990) Introduction to algorithms. McGraw-Hill, New York"},{"key":"310_CR1623","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0378-8733(95)00259-6","volume":"18","author":"P Doreian","year":"1996","unstructured":"Doreian P, Mrvar A (1996) A partitioning approach to structural balance. Soc Netw 18:149\u2013168","journal-title":"Soc Netw"},{"issue":"1","key":"310_CR1624","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.socnet.2008.08.001","volume":"31","author":"P Doreian","year":"2009","unstructured":"Doreian P, Mrvar A (2009) Partitioning signed social networks. Soc Netw 31(1):1\u201311","journal-title":"Soc Netw"},{"key":"310_CR1625","first-page":"31","volume":"11","author":"P Doreian","year":"2014","unstructured":"Doreian P, Mrvar A (2014) Testing two theories for generating signed networks using real data. Adv Methodol Stat 11:31\u201363. Faculty of Social Sciences, Ljubljana","journal-title":"Adv Methodol Stat"},{"key":"310_CR1626","doi-asserted-by":"crossref","unstructured":"Doreian P, Mrvar A (2015) Structural balance and signed international relations. J Soc Struct 16. Carnegie Mellon University, Pittsburgh, 1\u201349","DOI":"10.21307\/joss-2019-012"},{"issue":"2","key":"310_CR1627","doi-asserted-by":"publisher","first-page":"6","DOI":"10.17266\/35.2.1","volume":"35","author":"P Doreian","year":"2016","unstructured":"Doreian P, Mrvar A (2016) Identifying fragments in networks for structural balance and tracking the levels of balance over time. Connections 35(2):6\u201318","journal-title":"Connections"},{"issue":"1","key":"310_CR1628","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s003570000002","volume":"17","author":"P Doreian","year":"2000","unstructured":"Doreian P, Batagelj V, Ferligoj A (2000) Symmetric-acyclic decompositions of networks. J Classif 17(1):3\u201328","journal-title":"J Classif"},{"issue":"1","key":"310_CR1629","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.socnet.2004.01.002","volume":"26","author":"P Doreian","year":"2004","unstructured":"Doreian P, Batagelj V, Ferligoj A (2004) Generalized blockmodeling of two-mode network data. Soc Netw 26(1):29\u201353","journal-title":"Soc Netw"},{"key":"310_CR1630","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.socnet.2012.01.002","volume":"35","author":"P Doreian","year":"2013","unstructured":"Doreian P, Lloyd P, Mrvar A (2013) Partitioning large signed two-mode networks: problems and prospects. Soc Netw 35:178\u2013203","journal-title":"Soc Netw"},{"issue":"4","key":"310_CR1631","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BF02293878","volume":"48","author":"A Ferligoj","year":"1983","unstructured":"Ferligoj A, Batagelj V (1983) Some types of clustering with relational constraints. Psychometrika 48(4):541\u2013552","journal-title":"Psychometrika"},{"key":"310_CR1632","unstructured":"Hamberger K (2016) Puck \u2013 program for the use and computation of kinship data. http:\/\/www.kintip.net"},{"key":"310_CR1633","volume-title":"Structural models: an introduction to the theory of directed graphs","author":"F Harary","year":"1965","unstructured":"Harary F, Norman RZ, Cartwright D (1965) Structural models: an introduction to the theory of directed graphs. Wiley, New York"},{"issue":"1","key":"310_CR1634","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s12110-003-1016-y","volume":"14","author":"RA Hill","year":"2002","unstructured":"Hill RA, Dunbar RIM (2002) Social network size in humans. Hum Nat 14(1):53\u201372","journal-title":"Hum Nat"},{"key":"310_CR1635","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0378-8733(89)90017-8","volume":"11","author":"NP Hummon","year":"1989","unstructured":"Hummon NP, Doreian P (1989) Connectivity in a citation network: the development of DNA theory. Soc Netw 11:39\u201363","journal-title":"Soc Netw"},{"key":"310_CR1636","unstructured":"Kleinberg J (1998) Authoritative sources in a hyperlinked environment. In: Proceedings of 9th ACM-SIAM symposium on discrete algorithms, San Francisco, pp 668\u2013677. http:\/\/www.cs.cornell.edu\/home\/kleinber\/auth.ps"},{"key":"310_CR1637","unstructured":"Leydesdorff L (2016) Web site: http:\/\/www.leydesdorff.net\/"},{"key":"310_CR1638","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1002\/asi.21692","volume":"63","author":"JS Liu","year":"2012","unstructured":"Liu JS, Lu LYY (2012) An integrated approach for main path analysis: development of the Hirsch index as an example. J Am Soc Inf Sci Technol 63:528\u2013542","journal-title":"J Am Soc Inf Sci Technol"},{"key":"310_CR1639","first-page":"116","volume-title":"Survey automation","author":"T McCabe","year":"2003","unstructured":"McCabe T (2003) Computer science approaches: visualization tools and software metrics. In: Survey automation. NAP, Washington, DC, pp 116\u2013136"},{"issue":"3","key":"310_CR1640","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1080\/00222500902946210","volume":"33","author":"A Mrvar","year":"2009","unstructured":"Mrvar A, Doreian P (2009) Partitioning signed two-mode networks. J Math Sociol 33(3):196\u2013221","journal-title":"J Math Sociol"},{"issue":"8","key":"310_CR1641","doi-asserted-by":"publisher","first-page":"5207","DOI":"10.1073\/pnas.032085699","volume":"99","author":"DM Pennock","year":"2002","unstructured":"Pennock DM et al (2002) Winners don\u2019t take all. PNAS 99(8):5207\u20135211","journal-title":"PNAS"},{"key":"310_CR1642","volume-title":"Petri net theory and the modeling of systems","author":"JL Peterson","year":"1981","unstructured":"Peterson JL (1981) Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs"},{"key":"310_CR1643","doi-asserted-by":"publisher","first-page":"2.3","DOI":"10.1145\/1963190.1970376","volume":"16","author":"R Rotta","year":"2011","unstructured":"Rotta R, Noack A (2011) Multilevel local search algorithms for modularity clustering. J Exp Algorithmics 16:2.3","journal-title":"J Exp Algorithmics"},{"issue":"4","key":"310_CR1644","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0898-1221(88)90221-0","volume":"15","author":"RW Schvaneveldt","year":"1988","unstructured":"Schvaneveldt RW, Dearholt DW, Durso FT (1988) Graph theoretic foundations of pathfinder networks. Comput Math Appl 15(4):337\u2013345","journal-title":"Comput Math Appl"},{"key":"310_CR1645","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5:269\u2013287","journal-title":"Soc Netw"},{"key":"310_CR1646","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"RE Tarjan","year":"1983","unstructured":"Tarjan RE (1983) Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"310_CR1647","unstructured":"VOSviewer web site: http:\/\/www.vosviewer.com\/"},{"key":"310_CR1648","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.joi.2010.07.002","volume":"4","author":"L Waltman","year":"2010","unstructured":"Waltman L, van Eck NJ, Noyons ECM (2010) A unified approach to mapping and clustering of bibliometric networks. J Informetr 4:629\u2013635","journal-title":"J Informetr"},{"key":"310_CR1649","unstructured":"White D (2016) Web site: http:\/\/eclectic.ss.uci.edu\/~drwhite\/"},{"issue":"3","key":"310_CR1650","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1177\/089443939901700302","volume":"17","author":"DR White","year":"1999","unstructured":"White DR, Batagelj V, Mrvar A (1999) Analyzing large kinship and marriage networks with graph and Pajek. Soc Sci Comput Rev 17(3):245\u2013274","journal-title":"Soc Sci Comput Rev"},{"key":"310_CR1651","unstructured":"Zaver\u0161nik M, Batagelj V (2004) Islands, slides from Sunbelt XXIV, Portoro\u017e, 12\u201316 May 2004. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/doc\/sunbelt\/islands.pdf"}],"container-title":["Encyclopedia of Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-7131-2_310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T13:32:56Z","timestamp":1661434376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-7131-2_310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781493971305","9781493971312"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_310","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}