{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:57:59Z","timestamp":1781571479789,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433095","type":"print"},{"value":"9783540458487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_54","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:47:53Z","timestamp":1186829273000},"page":"477-478","source":"Crossref","is-referenced-by-count":118,"title":["Pajek\u2014 Analysis and Visualization of Large Networks"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Batagelj","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrej","family":"Mrvar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"issue":"2","key":"54_CR1","first-page":"47","volume":"21","author":"V. Batagelj","year":"1998","unstructured":"Batagelj, V., Mrvar, A. (1998): Pajek \u2014 A Program for Large Network Analysis. Connections, 21 (2), 47\u201357.","journal-title":"Connections"},{"key":"54_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 Erd\u0151s Collaboration Graph. Social Networks, 22, 173\u2013186.","journal-title":"Social Networks"},{"key":"54_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. Social Networks, 23, 237\u2013243.","journal-title":"Social Networks"},{"key":"54_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-46648-7_9","volume-title":"Partitioning Approach to Visualization of Large Graphs","author":"V. Batagelj","year":"1999","unstructured":"Batagelj, V., Mrvar, A., Zaver\u0161nik M. (1999): Partitioning Approach to Visualization of Large Graphs. Kratochvil, J. (Ed.) Graph Drawing. 7th International Symposium, GD\u201999, \u0160ti\u0159in Castle, Czech Republic, Proceedings. Lecture Notes in Computer Science, 1731. Springer-Verlag, Berlin\/Heidelberg, 90\u201397."},{"issue":"3","key":"54_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1177\/089443939901700302","volume":"17","author":"D.R. White","year":"1999","unstructured":"White, D.R., Batagelj, V., Mrvar, A. (1999): Analyzing Large Kinship and Marriage Networks with Pgraph and Pajek. Social Science Computer Review, 17 (3), 245\u2013274.","journal-title":"Social Science Computer Review"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T12:05:34Z","timestamp":1539000334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}