{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:45:29Z","timestamp":1743090329373,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030293994"},{"type":"electronic","value":"9783030294007"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_31","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"434-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Adaptive Sampling with Almost No Synchronization"],"prefix":"10.1007","author":[{"given":"Alexander van der","family":"Grinten","sequence":"first","affiliation":[]},{"given":"Eugenio","family":"Angriman","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Arbel, M., Attiya, H.: Concurrent updates with RCU: search tree as an example. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, pp. 196\u2013205. ACM (2014)","DOI":"10.1145\/2611462.2611471"},{"key":"31_CR2","unstructured":"Bader, D.A., Cong, G., Feo, J.: On the architectural requirements for efficient execution of graph algorithms. In: 2005 International Conference on Parallel Processing, ICPP 2005, pp. 547\u2013556. IEEE (2005)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77004-6_10","volume-title":"Algorithms and Models for the Web-Graph","author":"DA Bader","year":"2007","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 124\u2013137. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_10"},{"issue":"3\u20134","key":"31_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1080\/15427951.2013.865686","volume":"10","author":"P Boldi","year":"2014","unstructured":"Boldi, P., Vigna, S.: Axioms for centrality. Internet Math. 10(3\u20134), 222\u2013262 (2014). https:\/\/doi.org\/10.1080\/15427951.2013.865686","journal-title":"Internet Math."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2016.03.005","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electr. Notes Theor. Comput. Sci. 322, 51\u201367 (2016). https:\/\/doi.org\/10.1016\/j.entcs.2016.03.005","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"Borassi, M., Natale, E.: KADABRA is an adaptive algorithm for betweenness via random approximation. In: 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, 22\u201324 August 2016, pp. 20:1\u201320:18 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2016.20","DOI":"10.4230\/LIPIcs.ESA.2016.20"},{"key":"31_CR7","unstructured":"Boyd-Wickizer, S., et al.: An analysis of Linux scalability to many cores. In: OSDI, vol. 10, pp. 86\u201393 (2010)"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"31_CR9","unstructured":"Chehreghani, M.H., Bifet, A., Abdessalem, T.: Novel adaptive algorithms for estimating betweenness, coverage and k-path centralities. CoRR abs\/1810.10094 (2018). http:\/\/arxiv.org\/abs\/1810.10094"},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/2248487.2150998","volume":"47","author":"AT Clements","year":"2012","unstructured":"Clements, A.T., Kaashoek, M.F., Zeldovich, N.: Scalable address spaces using RCU balanced trees. ACM SIGPLAN Not. 47(4), 199\u2013210 (2012)","journal-title":"ACM SIGPLAN Not."},{"key":"31_CR11","doi-asserted-by":"publisher","unstructured":"David, T., Guerraoui, R., Trigonakis, V.: Everything you always wanted to know about synchronization but were afraid to ask. In: ACM SIGOPS 24th Symposium on Operating Systems Principles, SOSP 2013, Farmington, PA, USA, 3\u20136 November 2013, pp. 33\u201348 (2013). https:\/\/doi.org\/10.1145\/2517349.2522714","DOI":"10.1145\/2517349.2522714"},{"key":"31_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749","volume-title":"Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall\/Crc Computer & Information Science Series)","author":"TF Gonzalez","year":"2007","unstructured":"Gonzalez, T.F.: Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall\/Crc Computer & Information Science Series). Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"31_CR13","unstructured":"van der Grinten, A., Angriman, E., Meyerhenke, H.: Parallel adaptive sampling with almost no synchronization. CoRR abs\/1903.09422 (2019). https:\/\/arxiv.org\/abs\/1903.09422"},{"issue":"22","key":"31_CR14","doi-asserted-by":"publisher","first-page":"7794","DOI":"10.1073\/pnas.0407994102","volume":"102","author":"R Guimera","year":"2005","unstructured":"Guimera, R., Mossa, S., Turtschi, A., Amaral, L.N.: The worldwide air transportation network: anomalous centrality, community structure, and cities\u2019 global roles. Proc. Natl. Acad. Sci. 102(22), 7794\u20137799 (2005)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"31_CR15","unstructured":"ISO: ISO\/IEC 14882:2011 Information technology \u2013 Programming languages \u2013 C++. International Organization for Standardization, Geneva, Switzerland, February 2012. http:\/\/www.iso.org\/iso\/iso_catalogue\/catalogue_tc\/catalogue_detail.htm?csnumber=50372"},{"issue":"6833","key":"31_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barab\u00e1si, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41 (2001)","journal-title":"Nature"},{"key":"31_CR17","unstructured":"Lipton, R.J., Naughton, J.F.: Estimating the size of generalized transitive closures. In: Proceedings of the 15th International Conference on Very Large Data Bases (1989)"},{"issue":"01","key":"31_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine, A., Gregor, D., Hendrickson, B., Berry, J.: Challenges in parallel graph processing. Parallel Process. Lett. 17(01), 5\u201320 (2007)","journal-title":"Parallel Process. Lett."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Madduri, K., Ediger, D., Jiang, K., Bader, D.A., Chavarria-Miranda, D.: A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In: IEEE International Symposium on Parallel & Distributed Processing, IPDPS 2009, pp. 1\u20138. IEEE (2009)","DOI":"10.1109\/IPDPS.2009.5161100"},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/s40649-019-0062-5","volume":"6","author":"J Matta","year":"2019","unstructured":"Matta, J., Ercal, G., Sinha, K.: Comparing the speed and accuracy of approaches to betweenness centrality approximation. Comput. Soc. Netw. 6(1), 2 (2019)","journal-title":"Comput. Soc. Netw."},{"key":"31_CR21","unstructured":"McKenney, P.E., Slingwine, J.D.: Read-copy update: using execution history to solve concurrency problems. In: Parallel and Distributed Computing and Systems, pp. 509\u2013518 (1998)"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"McLaughlin, A., Bader, D.A.: Scalable and high performance betweenness centrality on the GPU. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 572\u2013583. IEEE Press (2014)","DOI":"10.1109\/SC.2014.52"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"6","author":"MM Michael","year":"2004","unstructured":"Michael, M.M.: Hazard pointers: safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. 6, 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Mumtaz, S., Wang, X.: Identifying top-k influential nodes in networks. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 2219\u20132222. ACM (2017)","DOI":"10.1145\/3132847.3133126"},{"key":"31_CR25","unstructured":"Oktay, H., Balkir, A.S., Foster, I., Jensen, D.D.: Distance estimation for very large networks using mapreduce and network structure indices. In: Workshop on Information Networks (2011)"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Provost, F., Jensen, D., Oates, T.: Efficient progressive sampling. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 23\u201332. ACM (1999)","DOI":"10.1145\/312129.312188"},{"issue":"2","key":"31_CR27","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10618-015-0423-0","volume":"30","author":"M Riondato","year":"2016","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438\u2013475 (2016)","journal-title":"Data Min. Knowl. Discov."},{"issue":"5","key":"31_CR28","first-page":"61","volume":"12","author":"M Riondato","year":"2018","unstructured":"Riondato, M., Upfal, E.: ABRA: approximating betweenness centrality in static and dynamic graphs with rademacher averages. ACM Trans. Knowl. Discov. Data (TKDD) 12(5), 61 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"4","key":"31_CR29","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"CL Staudt","year":"2016","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: NetworKit: a tool suite for large-scale complex network analysis. Netw. Sci. 4(4), 508\u2013530 (2016)","journal-title":"Netw. Sci."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:05:22Z","timestamp":1691885122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}