{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:36:53Z","timestamp":1740177413284,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,5]],"date-time":"2016-09-05T00:00:00Z","timestamp":1473033600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Technische Universit\u00e4t Dresden (DE)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s41109-016-0011-2","type":"journal-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:36:04Z","timestamp":1470641764000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis"],"prefix":"10.1007","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5956-0668","authenticated-orcid":false,"given":"Benjamin","family":"Schiller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Deusser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeronimo","family":"Castrillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Strufe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,5]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.6026\/97320630011090","volume":"11","author":"C Ambedkar","year":"2015","unstructured":"Ambedkar, C, Reddi KK, Muppalaneni NB, Kalyani D (2015) Application of centrality measures in the identification of critical genes in diabetes mellitus. Bioinformation 11(2): 90.","journal-title":"Bioinformation"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bader, DA, Madduri K (2008) Snap, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks In: Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on, 1\u201312.. IEEE.","DOI":"10.1109\/IPDPS.2008.4536261"},{"key":"11_CR3","unstructured":"Bader DA, Berry J, Amos-Binks A, Chavarr\u00eda-Miranda D, Hastings C, Madduri K, Poulos SC2009. Stinger: Spatio-temporal interaction networks and graphs (sting) extensible representation. Georgia Institute of Technology, Tech. Rep."},{"issue":"2","key":"11_CR4","first-page":"47","volume":"21","author":"V Batagelj","year":"1998","unstructured":"Batagelj, V, Mrvar A (1998) Pajek-program for large network analysis. Connections 21(2): 47\u201357.","journal-title":"Connections"},{"key":"11_CR5","unstructured":"Blandford, DK, Blelloch GE, Kash IA (2003) Compact representations of separable graphs In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics. pp 679\u2013688."},{"key":"11_CR6","unstructured":"Blandford, DK, et al. (2004) Experimental analysis of a compact graph representation."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Braha, D, Bar-Yam Y (2009) Time-dependent complex networks: Dynamic centrality, dynamic motifs, and cycles of social interactions In: Adaptive Networks, 39\u201350.. Springer.","DOI":"10.1007\/978-3-642-01284-6_3"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Candau, S, Bastide J, Delsanti M (1982) Structural, elastic, and dynamic properties of swollen polymer networks In: Polymer Networks, 27\u201371.. Springer.","DOI":"10.1007\/3-540-11471-8_2"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I Chabini","year":"1998","unstructured":"Chabini, I (1998) Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Research Record: J Transp Res Board1645: 170\u2013175.","journal-title":"Transportation Research Record: J Transp Res Board"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Ciglan, M, Averbuch A, Hluchy L (2012) Benchmarking traversal operations over graph databases In: Data Engineering Workshops (ICDEW), 2012 IEEE 28th International Conference on, 186\u2013189.. IEEE.","DOI":"10.1109\/ICDEW.2012.47"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"De Wael M, Marr S, De Koster J, Sartor JB, De Meuter W (2015) Just-in-time data structures In: 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), 61\u201375.. ACM.","DOI":"10.1145\/2814228.2814231"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Dmitriev, M (2004) Profiling Java applications using code hotswapping and dynamic call graph revelation In: ACM SIGSOFT Software Engineering Notes, 139\u2013150.. ACM.","DOI":"10.1145\/974044.974067"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Ediger, D, Jiang K, Riedy J, Bader DA (2010) Massive streaming data analytics: A case study with clustering coefficients In: Parallel and Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on., 1\u20138.. IEEE.","DOI":"10.1109\/IPDPSW.2010.5470687"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Ediger, D, McColl R, Riedy J, Bader DA (2012) Stinger: High performance data structure for streaming graphs In: High Performance Extreme Computing (HPEC), 2012 IEEE Conference on, 1\u20135.. IEEE.","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, KC, Vieira AB, Almeida JM, da Silva APC, Marques-Neto H, Campos SVA (2012) Characterizing dynamic properties of the SopCast overlay network In: 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, 319\u2013326.. IEEE.","DOI":"10.1109\/PDP.2012.90"},{"key":"11_CR16","unstructured":"Hunt, C, John B (2011) Java performance.. Prentice Hall Press."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Jung, C, Rus S, Railing BP, Clark N, Pande S (2011) Brainy: effective selection of data structures In: ACM SIGPLAN Notices. ACM, 86\u201397.","DOI":"10.1145\/1993498.1993509"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Kiczales, G, Hilsdale E, Hugunin J, Kersten M, Palm J, Griswold WG (2001) An overview of AspectJ In: European Conference on Object-Oriented Programming, 327\u2013354.. Springer.","DOI":"10.1007\/3-540-45337-7_18"},{"issue":"5757","key":"11_CR19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets, G, Watts DJ (2006) Empirical analysis of an evolving social network. Science311(5757): 88\u201390.","journal-title":"Science"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Kunegis, J (2013) Konect: the koblenz network collection In: Proceedings of the 22nd International Conference on World Wide Web, 1343\u20131350.. ACM.","DOI":"10.1145\/2487788.2488173"},{"issue":"6","key":"11_CR21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/1064978.1065034","volume":"40","author":"CK Luk","year":"2005","unstructured":"Luk, CK, Cohn R, Muth R, Patil H, Klauser A, Lowney G, Wallace S, Reddi VJ, Hazelwood K (2005) Pin: building customized program analysis tools with dynamic instrumentation. ACM Sigplan Notices 40(6): 190\u2013200.","journal-title":"ACM Sigplan Notices"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Madduri, K, Bader DA (2009) Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis In: Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on, 1\u201311.. IEEE.","DOI":"10.1109\/IPDPS.2009.5161060"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Malewicz, G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, 135\u2013146.. ACM.","DOI":"10.1145\/1807167.1807184"},{"issue":"1","key":"11_CR24","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1103\/PhysRevE.61.449","volume":"61","author":"J Marti","year":"2000","unstructured":"Marti, J (2000) Dynamic properties of hydrogen-bonded networks in supercritical water. Phys Rev E 61(1): 449.","journal-title":"Phys Rev E"},{"key":"11_CR25","unstructured":"Broder, A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2009) Graph structure in the web. Comp Net. 33(1):309\u2013320."},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Mucha, PJ, et al. (2010) Community structure in time-dependent networks. Science 1:12011.","DOI":"10.1126\/science.1184819"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Macko, P, et al. (2014) Llama: Efficient graph analytics using large multiversioned arrays. PhD thesis In: Ph. D. Dissertation. Harvard University.","DOI":"10.1109\/ICDE.2015.7113298"},{"key":"11_CR28","unstructured":"Schiller, B, Strufe T (2013) Dynamic network analyzer building a framework for the graph-theoretic analysis of dynamic networks In: Proceedings of the 2013 Summer Computer Simulation Conference, 49.. Society for Modeling & Simulation International."},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Schiller, B, Castrillon J, Strufe T (2015) Efficient data structures for dynamic graph analysis In: 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), 497\u2013504.. IEEE.","DOI":"10.1109\/SITIS.2015.94"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Schiller, B, Jager S, Hamacher K, Strufe T (2015) StreaM-A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs In: International Conference on Algorithms for Computational Biology, 53\u201367.. Springer.","DOI":"10.1007\/978-3-319-21233-3_5"},{"key":"11_CR31","unstructured":"Shirazi, J (2003) Java performance tuning. O\u2019Reilly Media, Inc."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Shacham, O, Vechev M, Yahav E (2009) Chameleon: adaptive selection of collections In: ACM Sigplan Notices, 408\u2013418.. ACM.","DOI":"10.1145\/1542476.1542522"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Sun, J, Xie Yinglian, Zhang H, Faloutsos C (2007) Less is More: Compact Matrix Decomposition for Large Sparse Graphs. In: SDM, 366\u2013377.. SIAM.","DOI":"10.1137\/1.9781611972771.33"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Trequattrini, R, et al. (2015) Network analysis and football team performance: a first application In: Team Performance Management.","DOI":"10.1108\/TPM-03-2014-0016"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Xu, G (2013) CoCo: sound and adaptive replacement of java collections In: European Conference on Object-Oriented Programming, 1\u201326.. Springer.","DOI":"10.1007\/978-3-642-39038-8_1"},{"issue":"8","key":"11_CR36","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1016\/j.combustflame.2015.05.011","volume":"162","author":"P Zhao","year":"2015","unstructured":"Zhao, P, Nackman SM, Law CK (2015) On the application of betweenness centrality in chemical network analysis: Computational diagnostics and model reduction. Combustion and Flame 162(8): 2991\u20132998.","journal-title":"Combustion and Flame"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-016-0011-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-016-0011-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-016-0011-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T04:28:38Z","timestamp":1568262518000},"score":1,"resource":{"primary":{"URL":"http:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-016-0011-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,5]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s41109-016-0011-2","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2016,9,5]]},"article-number":"9"}}