{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T13:56:53Z","timestamp":1776866213209,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642622144","type":"print"},{"value":"9783642186387","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-642-18638-7_4","type":"book-chapter","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T02:57:24Z","timestamp":1303527444000},"page":"77-103","source":"Crossref","is-referenced-by-count":194,"title":["Pajek \u2014 Analysis and Visualization of Large Networks"],"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","reference":[{"key":"4_CR1","unstructured":"Adobe SVG Viewer (2002) http:\/\/www.adobe.com\/svg\/viewer\/install\/"},{"key":"4_CR2","unstructured":"Batagelj, V. (1986) Graph \u2014 data structure and algorithms in pascal. Research report"},{"key":"4_CR3","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. Social Networks 19, 143\u2013155","journal-title":"Social Networks"},{"key":"4_CR4","unstructured":"Batagelj, V. (2002) Efficient Algorithms for Citation Network Analysis, in preparation"},{"key":"4_CR5","unstructured":"Batagelj, V., Brandes, U. (2002) Fast generation of large sparse random graphs, in preparation"},{"key":"4_CR6","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. (1992) An Optimizational Approach to Regular Equivalence. Social Networks 14, 121\u2013135","journal-title":"Social Networks"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-58250-9_1","volume-title":"Data Analysis","author":"V Batagelj","year":"2000","unstructured":"Batagelj, V., Ferligoj, A. (2000) Clustering relational data. In: W. Gaul, O. Opitz, M. Schader (eds.) Data Analysis, Springer-Verlag, Berlin, 3\u201315"},{"key":"4_CR8","unstructured":"Batagelj, V., Mrvar, A. (1995) Towards NetML Networks Markup Language. Presented at International Social Network Conference, London, July 6\u201310, 1995. http:\/\/www.ijp.si\/ftp\/pub\/preprints\/ps\/95\/trp9515.ps"},{"key":"4_CR9","unstructured":"Batagelj, V., Mrvar, A. (1991\u201394) Programs for Network Analysis, http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/"},{"issue":"2","key":"4_CR10","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":"4_CR11","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. Social Networks 22, 173\u2013186","journal-title":"Social Networks"},{"key":"4_CR12","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":"4_CR13","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A. (2002) Pajek \u2014 Analysis and Visualization of Large Networks. In: P. Mutzel, M. J\u00fcnger, S. Leipert (eds.) Graph Drawing \u203201, Lecture Notes in Computer Science 2265, Springer-Verlag, 477\u2013478","DOI":"10.1007\/3-540-45848-4_54"},{"key":"4_CR14","unstructured":"Batagelj, V., Mrvar, A. (2002) Density based approaches to Reuters terror news network analysis, submitted"},{"key":"4_CR15","unstructured":"Batagelj, V., Pisanski, T. (1989) Xgraph project documentation"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A., Zaversnik, M. (1999) Partitioning Approach to Visualization of Large Graphs. In: J. Kratochvfl (ed.) Graph Drawing \u203299, \u0160t i\u0159in Castle, Czech Republic. Lecture Notes in Computer Science 1731, SpringerVerlag, 90\u201397","DOI":"10.1007\/3-540-46648-7_9"},{"key":"4_CR17","unstructured":"Batagelj, V., Mrvar, A., Zaver\u0161nik, M. (2002) Network analysis of texts. Language Technologies, Ljubljana, 143\u2013148"},{"key":"4_CR18","unstructured":"Batagelj, V., Zaver\u0161nik, M. (2001) An 0(m) Algorithm for Cores Decomposition of Networks, submitted"},{"key":"4_CR19","unstructured":"Batagelj, V., Zaversnik, M. (2002) Generalized Cores, submitted http:\/\/arxiv.org\/abs\/cs.DS\/0202039"},{"key":"4_CR20","unstructured":"Batagelj, V. and Zaversnik, M. (2002) Triangular connectivity and its generalizations, in preparation"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Butts, C. T. (2002) sna: Tools for Social Network Analysis. http:\/\/cran.at.r-project.org\/src\/contrib\/PACKAGES.html\\#sna","DOI":"10.32614\/CRAN.package.sna"},{"key":"4_CR22","unstructured":"Caida: Internet Visualization Tool Taxonomy. http:\/\/www.caida.org\/tools\/taxonomy\/visualization\/"},{"key":"4_CR23","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. (2001) Introduction to Algorithms, Second Edition, MIT Press"},{"key":"4_CR24","unstructured":"Cosmo Player (2002) http:\/\/ca.com\/cosmo\/"},{"key":"4_CR25","unstructured":"de Nooy, W., Mrvar, A., Batagelj, V. (2002) Exploratory Social Network Analysis With Pajek. to be published by the Cambridge University Press"},{"key":"4_CR26","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. Social Networks 18, 149\u2013168","journal-title":"Social Networks"},{"issue":"1","key":"4_CR27","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"},{"key":"4_CR28","unstructured":"Dremelj, P., Mrvar, A., Batagelj, V. (2002) Analiza rodoslova dubrovackog vlasteoskog kruga pomocu programa Pajek. Anali Dubrovnik XL, HAZU, Zagreb, Dubrovnik, 105\u2013126 (in Croatian)"},{"key":"4_CR29","doi-asserted-by":"crossref","DOI":"10.21236\/AD0466578","volume-title":"The Use of Citation Data in Writing the History of Science","author":"E Garfield","year":"1964","unstructured":"Garfield, E., Sher, I. H., Torpie, R. J. (1964) The Use of Citation Data in Writing the History of Science. Philadelphia: The Institute for Scientific Information http:\/\/www.garfield.library.upenn.edu\/papers\/useofcitdatawritinghistofsei.pdf"},{"key":"4_CR30","unstructured":"GEDCOM 5.5. http:\/\/homepages.rootsweb.com\/~pmcbride\/gedcom\/55gctoc.htm"},{"key":"4_CR31","unstructured":"Ghostscript, Ghostview and GSview, http:\/\/www.cs.wise.edu\/~ghost\/"},{"key":"4_CR32","unstructured":"Graph Drawing Contest 1997. http:\/\/vlado.fmf.uni-lj.si\/pub\/gd\/gd97.htm"},{"key":"4_CR33","unstructured":"Grossman, J. (2002) The Erd\u00f6s Number Project, http:\/\/www.Oakland.edu\/~grossman\/erdoshp.html"},{"key":"4_CR34","first-page":"121","volume-title":"Metodolo\u0161ki zvezki","author":"V Hlebec","year":"1993","unstructured":"Hlebec, V. (1993) Recall versus recognition: Comparison of two alternative procedures for collecting social network data. Metodolo\u0161ki zvezki 9, Ljubljana: FDV, 121\u2013128"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0378-8733(89)90017-8","volume":"11","author":"NP Hummon","year":"1989","unstructured":"Hummon, N. P., Doreian, P. (1989) Connectivity in a citation network: The development of DNA theory. Social Networks 11, 39\u201363","journal-title":"Social Networks"},{"key":"4_CR36","unstructured":"Jones B. (2002). Computational geometry database. http:\/\/compgeom.cs.uiuc.edu\/~jeffe\/compgeom\/biblios.html"},{"key":"4_CR37","unstructured":"MDL Information Systems, Inc. (2002) http:\/\/www.mdli.com\/"},{"key":"4_CR38","unstructured":"James Moody home page (2002) http:\/\/www.soc.sbs.ohio-state.edu\/jwm\/"},{"key":"4_CR39","volume-title":"Compstat lectures","author":"F Murtagh","year":"1985","unstructured":"Murtagh, F. (1985) Multidimensional Clustering Algorithms, Compstat lectures 4, Vienna: Physica-Verlag"},{"key":"4_CR40","unstructured":"ODLIS (2002) Online dictionary of library and information science, http:\/\/vax.wesu.edu\/library\/odlis.html"},{"issue":"8","key":"4_CR41","doi-asserted-by":"publisher","first-page":"5207","DOI":"10.1073\/pnas.032085699","volume":"99","author":"DM Pennock","year":"2002","unstructured":"Pennock, D.M. et al. (2002) Winners don\u2019t take all, PNAS 99(8), 5207\u20135211","journal-title":"Winners don\u2019t take all, PNAS"},{"key":"4_CR42","unstructured":"The R Project for Statistical Computing, http:\/\/www.r-project.org\/"},{"key":"4_CR43","unstructured":"Richardson, D. C, Richardson, J. S. (2002) The Mage Page, http:\/\/kinemage.biochem.duke.edu\/index.html"},{"key":"4_CR44","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S. B. (1983) Network structure and minimum degree, Social Networks 5, 269\u2013287","journal-title":"Social Networks"},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"UCINET (2002) http:\/\/www.analytictech.com\/","DOI":"10.1145\/504689.504690"},{"key":"4_CR46","unstructured":"Project Vega (2002) http:\/\/vega.ijp.si\/"},{"key":"4_CR47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K. (1994) Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge"},{"key":"4_CR48","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02294547","volume":"60","author":"S Wasserman","year":"1996","unstructured":"Wasserman, S., and Pattison, P. (1996) Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p *. Psychometrika 60, 401\u2013442, http:\/\/kentucky.psych.uiuc.edu\/pstar\/index.html","journal-title":"Psychometrika"},{"issue":"3","key":"4_CR49","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1177\/089443939901700302","volume":"17","author":"DR 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"},{"key":"4_CR50","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1038\/415180a","volume":"415","author":"H Yuen","year":"2002","unstructured":"Yuen Ho et al. (2002) Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry. Nature 415, 180\u2013183, http:\/\/www.mshri.on.ca\/tyers\/pdfs\/proteome.pdf","journal-title":"Nature"},{"key":"4_CR51","first-page":"113","volume-title":"Proceedings of Sixth Austrian, Hungarian, Italian and Slovenian Meeting of Young Statisticians","author":"M Zaver\u0161nik","year":"2002","unstructured":"Zaver\u0161nik, M., Batagelj, V., Mrvar, A. (2002) Analysis and visualization of 2-mode networks. In: Proceedings of Sixth Austrian, Hungarian, Italian and Slovenian Meeting of Young Statisticians, October 5\u20137, 2001, Ossiach, Austria. University of Klagenfurt, 113\u2013123"}],"container-title":["Mathematics and Visualization","Graph Drawing Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18638-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T06:29:56Z","timestamp":1741156196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18638-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642622144","9783642186387"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18638-7_4","relation":{},"ISSN":["1612-3786"],"issn-type":[{"value":"1612-3786","type":"print"}],"subject":[],"published":{"date-parts":[[2004]]}}}