{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:58:46Z","timestamp":1774022326606,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,29]],"date-time":"2016-04-29T00:00:00Z","timestamp":1461888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["ME 3619\/3-1"],"award-info":[{"award-number":["ME 3619\/3-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["WA 654\/22-1"],"award-info":[{"award-number":["WA 654\/22-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-016-0332-2","type":"journal-article","created":{"date-parts":[[2016,4,29]],"date-time":"2016-04-29T09:28:18Z","timestamp":1461922098000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Structure-preserving sparsification methods for social networks"],"prefix":"10.1007","volume":"6","author":[{"given":"Michael","family":"Hamann","sequence":"first","affiliation":[]},{"given":"Gerd","family":"Lindner","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]},{"given":"Christian L.","family":"Staudt","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,29]]},"reference":[{"issue":"2","key":"332_CR1","first-page":"7","volume":"8","author":"NK Ahmed","year":"2014","unstructured":"Ahmed NK, Neville J, Kompella R (2014) Network sampling: from static to streaming graphs. ACM Trans Knowl Discov Data (TKDD) 8(2):7","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"332_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"332_CR3","doi-asserted-by":"crossref","unstructured":"Bastian M, Heymann S, Jacomy M (2009) Gephi: An open source software for exploring and manipulating networks. In: Adar E, Hurst M, Finin T, Glance NS, Nicolov N, Tseng BL (eds) ICWSM, The AAAI Press. http:\/\/dblp.uni-trier.de\/db\/conf\/icwsm\/icwsm2009.html#BastianHJ09","DOI":"10.1609\/icwsm.v3i1.13937"},{"issue":"8","key":"332_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/2492007.2492029","volume":"56","author":"J Batson","year":"2013","unstructured":"Batson J, Spielman DA, Srivastava N, Teng SH (2013) Spectral sparsification of graphs: theory and algorithms. Commun ACM 56(8):87\u201394","journal-title":"Commun ACM"},{"key":"332_CR5","doi-asserted-by":"publisher","unstructured":"Borassi M, Crescenzi P, Habib M, Kosters WA, Marino A, Takes FW (2015) Fast diameter and radius bfs-based computation in (weakly connected) real-world graphs: with an application to the six degrees of separation games. Theor Comput Sci 586:59\u201380. doi: 10.1016\/j.tcs.2015.02.033 , http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397515001644 (fun with Algorithms)","DOI":"10.1016\/j.tcs.2015.02.033"},{"issue":"6","key":"332_CR6","doi-asserted-by":"crossref","first-page":"3468","DOI":"10.1137\/090775087","volume":"33","author":"J Chen","year":"2011","unstructured":"Chen J, Safro I (2011) Algebraic distance on graphs. SIAM J Sci Comput 33(6):3468\u20133490","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"332_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba N, Nishizeki T (1985) Arboricity and subgraph listing algorithms. SIAM J Comput 14(1):210\u2013223. doi: 10.1137\/0214017","journal-title":"SIAM J Comput"},{"issue":"3","key":"332_CR8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"LdF Costa","year":"2011","unstructured":"Costa LdF, Oliveira ON Jr, Travieso G, Rodrigues FA, Villas Boas PR, Antiqueira L, Viana MP, Correa Rocha LE (2011) Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Adv Phys 60(3):329\u2013412","journal-title":"Adv Phys"},{"key":"332_CR9","unstructured":"Ebbes P, Huang Z, Rangaswamy A, Thadakamalla HP, Unit ORGB (2008) Sampling large-scale social networks: insights from simulated networks. In: 18th annual workshop on information technologies and systems, Paris, France, Citeseer"},{"issue":"1","key":"332_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36\u201341","journal-title":"Proc Natl Acad Sci"},{"key":"332_CR11","doi-asserted-by":"crossref","unstructured":"Fortunato S, Bogu\u00f1\u00e1 M, Flammini A, Menczer F (2008) Approximating pagerank from in-degree. In: Aiello W, Broder A, Janssen J, Milios E (eds) Algorithms and models for the web-graph, Springer, Berlin, pp 59\u201371","DOI":"10.1007\/978-3-540-78808-9_6"},{"key":"332_CR12","doi-asserted-by":"crossref","unstructured":"Geisberger R, Sanders P, Schultes D (2008) Better approximation of betweenness centrality. In: ALENEX, SIAM, pp 90\u2013100","DOI":"10.1137\/1.9781611972887.9"},{"key":"332_CR13","doi-asserted-by":"crossref","unstructured":"Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 6(4):565\u2013574. http:\/\/dblp.uni-trier.de\/db\/journals\/advcs\/advcs6.html#GleiserD03","DOI":"10.1142\/S0219525903001067"},{"issue":"4","key":"332_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2691190.2691193","volume":"39","author":"X Hu","year":"2014","unstructured":"Hu X, Tao Y, Chung CW (2014) I\/o-efficient algorithms on triangle listing and counting. ACM Trans Database Syst 39(4):1\u201327. doi: 10.1145\/2691190.2691193","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"332_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193\u2013218. doi: 10.1007\/BF01908075","journal-title":"J Classif"},{"key":"332_CR16","doi-asserted-by":"crossref","unstructured":"John E, Safro I (2016) Single-and multi-level network sparsification by algebraic distance. arXiv:160105527 (arXiv preprint)","DOI":"10.1093\/comnet\/cnw025"},{"key":"332_CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841035","volume-title":"Modeling infectious diseases in humans and animals","author":"M Keeling","year":"2008","unstructured":"Keeling M, Rohani P (2008) Modeling infectious diseases in humans and animals. Princeton University Press, Princeton"},{"issue":"1","key":"332_CR18","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009a) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118. doi: 10.1103\/PhysRevE.80.016118","journal-title":"Phys Rev E"},{"key":"332_CR19","doi-asserted-by":"publisher","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009b) Community detection algorithms: a comparative analysis. Phys Rev E 80:056117. doi: 10.1103\/PhysRevE.80.056117","journal-title":"Phys Rev E"},{"key":"332_CR20","doi-asserted-by":"publisher","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201906, pp 631\u2013636. doi: 10.1145\/1150402.1150479","DOI":"10.1145\/1150402.1150479"},{"key":"332_CR21","first-page":"539","volume-title":"Advances in neural information processing systems 25","author":"J Leskovec","year":"2012","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Pereira F, Burges C, Bottou L, Weinberger K (eds) Advances in neural information processing systems 25. Curran Associates Inc, New York, pp 539\u2013547"},{"key":"332_CR22","doi-asserted-by":"publisher","unstructured":"Lindner G, Staudt CL, Hamann M, Meyerhenke H, Wagner D (2015) Structure-preserving sparsification of social networks. In: Pei J, Silvestri F, Tang J (eds) Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining, ASONAM 2015, Paris, France, August 25\u201328, 2015, ACM, pp 448\u2013454. doi: 10.1145\/2808797.2809313","DOI":"10.1145\/2808797.2809313"},{"key":"332_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M (2010) Networks: an introduction. Oxford University Press, Oxford"},{"key":"332_CR24","doi-asserted-by":"publisher","unstructured":"Nick B, Lee C, Cunningham P, Brandes U (2013) Simmelian backbones: Amplifying hidden homophily in facebook networks. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining, ACM, New York, NY, USA, ASONAM \u201913, pp 525\u2013532. doi: 10.1145\/2492517.2492569","DOI":"10.1145\/2492517.2492569"},{"key":"332_CR25","doi-asserted-by":"publisher","unstructured":"Nocaj A, Ortmann M, Brandes U (2014) Untangling hairballs\u2014from 3 to 14 degrees of separation. In: Duncan CA, Symvonis A (eds) Graph Drawing\u201422nd international symposium, GD 2014, W\u00fcrzburg, Germany, September 24-26, 2014 Revised Selected Papers, Lecture Notes in Computer Science, vol 8871. Springer, Berlin, pp 101\u2013112. doi: 10.1007\/978-3-662-45803-7_9","DOI":"10.1007\/978-3-662-45803-7_9"},{"key":"332_CR26","doi-asserted-by":"publisher","unstructured":"Ortmann M, Brandes U (2014) Triangle listing algorithms: Back from the diversion. In: McGeoch CC, Meyer U (eds) 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014, SIAM, pp 1\u20138. doi: 10.1137\/1.9781611973198.1","DOI":"10.1137\/1.9781611973198.1"},{"key":"332_CR27","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical Report 1999-66, Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/422\/, previous number = SIDL-WP-1999-0120"},{"issue":"1","key":"332_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Euro Phys J Spec Topics 178(1):13\u201323. doi: 10.1140\/epjst\/e2010-01179-1","journal-title":"Euro Phys J Spec Topics"},{"key":"332_CR29","doi-asserted-by":"crossref","unstructured":"Saha T, Rangwala H, Domeniconi C (2013) Sparsification and sampling of networks for collective classification. In: Greenberg AM, Kennedy WG, Bos ND (eds) Social Computing, Behavioral-cultural modeling and prediction. Springer, Berlin, pp 293\u2013302","DOI":"10.1007\/978-3-642-37210-0_32"},{"issue":"51","key":"332_CR30","doi-asserted-by":"crossref","first-page":"22020","DOI":"10.1073\/pnas.1009094108","volume":"107","author":"M Salath\u00e9","year":"2010","unstructured":"Salath\u00e9 M, Kazandjieva M, Lee JW, Levis P, Feldman MW, Jones JH (2010) A high-resolution human contact network for infectious disease transmission. Proc Natl Acad Sci 107(51):22020\u201322025","journal-title":"Proc Natl Acad Sci"},{"key":"332_CR31","doi-asserted-by":"publisher","unstructured":"Satuluri V, Parthasarathy S, Ruan Y (2011) Local graph sparsification for scalable clustering. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201911, pp 721\u2013732. doi: 10.1145\/1989323.1989399","DOI":"10.1145\/1989323.1989399"},{"key":"332_CR32","doi-asserted-by":"publisher","unstructured":"Serrano M\u00c1, Bogu\u00f1\u00e1 M, Vespignani A (2009) Extracting the multiscale backbone of complex weighted networks. Proc Natl Acad Sci 106(16):6483\u20136488. doi: 10.1073\/pnas.0808904106 , http:\/\/www.pnas.org\/content\/106\/16\/6483.abstract","DOI":"10.1073\/pnas.0808904106"},{"key":"332_CR33","doi-asserted-by":"crossref","unstructured":"Shun J, Tangwongsan K (2015) Multicore triangle computations without tuning. In: Proceedings of the IEEE international conference on data engineering (ICDE). http:\/\/dblp.unitrier.de\/rec\/bibtex\/conf\/icde\/ShunT15","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"332_CR34","unstructured":"Simmel G, Wolff K (1950) The sociology of Georg Simmel. Free Press paperback, Free Press. http:\/\/books.google.de\/books?id=Ha2aBqS415YC"},{"issue":"1","key":"332_CR35","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPDS.2015.2390633","volume":"27","author":"C Staudt","year":"2016","unstructured":"Staudt C, Meyerhenke H (2016) Engineering parallel algorithms for community detection in massive networks. IEEE Trans Parallel Distrib Syst 27(1):171\u2013184. doi: 10.1109\/TPDS.2015.2390633","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"332_CR36","unstructured":"Staudt C, Sazonovs A, Meyerhenke H (2014) Networkit: a tool suite for large-scale complex network analysis. CoRR http:\/\/arxiv.org\/abs\/1403.3005 , arXiv: abs\/1403.3005"},{"issue":"16","key":"332_CR37","doi-asserted-by":"crossref","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Phys A Stat Mech Appl 391(16):4165\u20134180","journal-title":"Phys A Stat Mech Appl"},{"key":"332_CR38","doi-asserted-by":"publisher","unstructured":"Vinh NX, Epps J, Bailey J (2009) Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: Proceedings of the 26th annual international conference on machine learning, ACM, New York, NY, USA, ICML \u201909, pp 1073\u20131080. doi: 10.1145\/1553374.1553511","DOI":"10.1145\/1553374.1553511"},{"key":"332_CR39","doi-asserted-by":"crossref","unstructured":"Wang Y, Chakrabarti D, Wang C, Faloutsos C (2003) Epidemic spreading in real networks: an eigenvalue viewpoint. In: Proceedings of the 22nd international symposium on reliable distributed systems, 2003, IEEE, pp 25\u201334","DOI":"10.1109\/RELDIS.2003.1238052"},{"key":"332_CR40","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD workshop on mining data semantics, ACM, p 3","DOI":"10.1145\/2350190.2350193"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0332-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0332-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0332-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0332-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T20:43:09Z","timestamp":1692304989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0332-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,29]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["332"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0332-2","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,29]]},"article-number":"22"}}