{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T17:07:42Z","timestamp":1778864862047,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T00:00:00Z","timestamp":1459900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T00:00:00Z","timestamp":1459900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Adapt Syst Model"],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Pajek is a program package for analysis and visualization of large networks (networks containing up to one billion of vertices, there is no limit\u2014except the memory size\u2014on the number of lines). It has been available for 20\u00a0years. The program, documentation and supporting material can be downloaded and used for free for noncommercial use from its web page:<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"http:\/\/mrvar.fdv.uni-lj.si\/pajek\/\">http:\/\/mrvar.fdv.uni-lj.si\/pajek\/<\/jats:ext-link><\/jats:p>","DOI":"10.1186\/s40294-016-0017-8","type":"journal-article","created":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T16:47:25Z","timestamp":1459961245000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":175,"title":["Analysis and visualization of large networks with program package Pajek"],"prefix":"10.1186","volume":"4","author":[{"given":"Andrej","family":"Mrvar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Batagelj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,6]]},"reference":[{"issue":"2","key":"17_CR1","first-page":"47","volume":"21","author":"V Batagelj","year":"1998","unstructured":"Batagelj V, Mrvar A (1998) Pajek\u2014a program for large network analysis. Connections 21(2):47\u201357","journal-title":"Connections"},{"key":"17_CR2","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 Erdos collaboration graph. Soc Netw 22:173\u2013186","journal-title":"Soc Netw"},{"key":"17_CR3","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:237\u2013243","journal-title":"Soc Netw"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A (2002) Pajek\u2014analysis and visualization of large networks. Lecture notes in computer science vol 2265, Springer-Verlag, pp 477\u2013478","DOI":"10.1007\/3-540-45848-4_54"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A (2003) Pajek\u2014analysis and visualization of large networks. In: M Juenger, P Mutzel (eds) Graph drawing software. Springer (series mathematics and visualization), pp 77\u2013103","DOI":"10.1007\/978-3-642-18638-7_4"},{"issue":"2","key":"17_CR6","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"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A (2014) Pajek. In: R Alhajj, J. Rokne (eds) Encyclopedia of social network analysis and mining. Springer, Heidelberg, pp 1245\u20131256","DOI":"10.1007\/978-1-4614-6170-8_310"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A, Zaver\u0161nik M (1999) Partitioning Approach to visualization of large graphs. Lecture notes in computer science vol 1731. Springer-Verlag, pp 90\u201397","DOI":"10.1007\/3-540-46648-7_9"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar A, Ferligoj A, Doreian P (2004) Generalized blockmodeling with Pajek. Advances in methodology and statistics, vol 1. FDV, Ljubljana, pp 455\u2013467","DOI":"10.51936\/ofaw1880"},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511806452","volume-title":"Exploratory social network analysis with Pajek","author":"W de Nooy","year":"2005","unstructured":"de Nooy W, Mrvar A, Batagelj V (2005) Exploratory social network analysis with Pajek. Cambridge University Press, New York"},{"key":"17_CR11","unstructured":"de Nooy W, Mrvar A, Batagelj V (2009) Pajek \u3092\u6d3b\u7528\u3057\u305f\u793e\u4f1a\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u5206\u6790, Tokyo Denki University Press, Tokyo"},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511996368","volume-title":"Exploratory social network analysis with Pajek: revised and expanded","author":"W de Nooy","year":"2011","unstructured":"de Nooy W, Mrvar A, Batagelj V (2011) Exploratory social network analysis with Pajek: revised and expanded, 2nd edn. Cambridge University Press, New York","edition":"2"},{"key":"17_CR13","unstructured":"de Nooy W, Mrvar A, Batagelj V (2012) \u8718\u86db : \u793e\u4f1a\u7f51\u7edc\u5206\u6790\u6280\u672f. Beijing World Publishing Corporation, Beijing"},{"key":"17_CR14","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"},{"key":"17_CR15","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\u201311","journal-title":"Soc Netw"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Doreian P, Mrvar A (2014) Testing two theories for generating signed networks using real data. Advances in Methodology and Statistics, vol 11. FDV, Ljubljana, pp 31\u201363","DOI":"10.51936\/luiz1097"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Doreian P, Mrvar A (2015) Structural balance and signed international relations. J Soc Struct 16","DOI":"10.21307\/joss-2019-012"},{"key":"17_CR18","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"},{"key":"17_CR19","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:196\u2013221","journal-title":"J Math Sociol"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1080\/10494820802190374","volume":"18","author":"M \u0160kerlavaj","year":"2010","unstructured":"\u0160kerlavaj M, Dimovski V, Mrvar A, Pahor M (2010) Intra-organizational learning networks within knowledge-intensive learning environments. Interact Learn Environ 18:39\u201363","journal-title":"Interact Learn Environ"},{"issue":"3","key":"17_CR21","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) Analysis of kinship relations with Pajek. Soc Sci Comput Rev 17(3):245\u2013274","journal-title":"Soc Sci Comput Rev"}],"container-title":["Complex Adaptive Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40294-016-0017-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40294-016-0017-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40294-016-0017-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40294-016-0017-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T05:25:53Z","timestamp":1655443553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s40294-016-0017-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,6]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["17"],"URL":"https:\/\/doi.org\/10.1186\/s40294-016-0017-8","relation":{},"ISSN":["2194-3206"],"issn-type":[{"value":"2194-3206","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,6]]},"assertion":[{"value":"17 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"6"}}