{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:32:36Z","timestamp":1762918356341,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031188398"},{"type":"electronic","value":"9783031188404"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18840-4_34","type":"book-chapter","created":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T07:04:51Z","timestamp":1667631891000},"page":"476-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Heuristic for\u00a0Computing Geodesic Closures in\u00a0Large Networks"],"prefix":"10.1007","author":[{"given":"Florian","family":"Seiffarth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,6]]},"reference":[{"key":"34_CR1","unstructured":"Allgeier, B.: Structure and properties of maximal outerplanar graphs. Ph.D. thesis (2009)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"de Ara\u00fajo, P.H.M., Camp\u00ealo, M.B., Corr\u00eaa, R.C., Labb\u00e9, M.: The geodesic classification problem on graphs. In: Proceedings of the 10th Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS. Electronic Notes in Theoretical Computer Science, vol. 346, pp. 65\u201376. Elsevier (2019)","DOI":"10.1016\/j.entcs.2019.08.007"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"S Borgatti","year":"1999","unstructured":"Borgatti, S., Everett, M.: Models of core\/periphery structures. Soc. Netw. 21, 375\u2013395 (1999)","journal-title":"Soc. Netw."},{"key":"34_CR4","unstructured":"Bressan, M., Cesa-Bianchi, N., Lattanzi, S., Paudice, A.: Exact recovery of clusters in finite metric spaces using oracle queries. In: COLT 2021. Proceedings of Machine Learning Research, vol. 134, pp. 775\u2013803. PMLR (2021)"},{"key":"34_CR5","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l\u2019I.H.P. Probabilit\u00e9s et statistiques 3(4), 433\u2013438 (1967)"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.endm.2018.07.037","volume":"69","author":"L Cunha","year":"2018","unstructured":"Cunha, L., Protti, F.: Closure of genomic sets: applications of graph convexity to genome rearrangement problems. Electron. Notes Discrete Math. 69, 285\u2013292 (2018)","journal-title":"Electron. Notes Discrete Math."},{"key":"34_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-60220-8_77","volume-title":"Algorithms and Data Structures","author":"HN Djidjev","year":"1995","unstructured":"Djidjev, H.N.: A linear algorithm for the maximal planar subgraph problem. In: Akl, S.G., Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 369\u2013380. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60220-8_77"},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s10618-009-0162-1","volume":"21","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21(3), 472\u2013508 (2010)","journal-title":"Data Min. Knowl. Discov."},{"key":"34_CR11","unstructured":"Leipert, S.: Level planarity testing and embedding in linear time. Ph.D. thesis (1998)"},{"key":"34_CR12","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: Snap: a general-purpose network analysis and graph-mining library. ACM TIST 8(1), 1 (2016)","journal-title":"ACM TIST"},{"key":"34_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8699-2","volume-title":"Geodesic Convexity in Graphs","author":"IM Pelayo","year":"2013","unstructured":"Pelayo, I.M.: Geodesic Convexity in Graphs. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-8699-2"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-46150-8_2","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"F Seiffarth","year":"2020","unstructured":"Seiffarth, F., Horv\u00e1th, T., Wrobel, S.: Maximal closed set and half-space separations in finite closure systems. In: Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M., Robardet, C. (eds.) ECML PKDD 2019. LNCS (LNAI), vol. 11906, pp. 21\u201337. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-46150-8_2"},{"key":"34_CR16","unstructured":"Seiffarth, F., Horv\u00e1th, T., Wrobel, S.: A fast heuristic for computing geodesic cores in large networks (2022). arXiv:2206.07350"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-86520-7_13","volume-title":"Machine Learning and Knowledge Discovery in Databases. Research Track","author":"E Stadtl\u00e4nder","year":"2021","unstructured":"Stadtl\u00e4nder, E., Horv\u00e1th, T., Wrobel, S.: Learning weakly convex sets in metric spaces. In: Oliver, N., P\u00e9rez-Cruz, F., Kramer, S., Read, J., Lozano, J.A. (eds.) ECML PKDD 2021. LNCS (LNAI), vol. 12976, pp. 200\u2013216. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86520-7_13"},{"key":"34_CR18","unstructured":"Thiessen, M., G\u00e4rtner, T.: Active learning of convex halfspaces on graphs. In: Advances in Neural Information Processing Systems (2021)"},{"issue":"2","key":"34_CR19","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1017\/nws.2017.37","volume":"6","author":"M Tilen","year":"2018","unstructured":"Tilen, M., \u0160ubelj, L.: Convexity in complex networks. Netw. Sci. 6(2), 176\u2013203 (2018)","journal-title":"Netw. Sci."},{"issue":"1","key":"34_CR20","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.joi.2018.11.005","volume":"13","author":"L \u0160ubelj","year":"2019","unstructured":"\u0160ubelj, L., Fiala, D., Ciglaric, T., Kronegger, L.: Convexity in scientific collaboration networks. J. Informet. 13(1), 10\u201331 (2019)","journal-title":"J. Informet."},{"issue":"145","key":"34_CR21","doi-asserted-by":"publisher","first-page":"20180422","DOI":"10.1098\/rsif.2018.0422","volume":"15","author":"L \u0160ubelj","year":"2018","unstructured":"\u0160ubelj, L.: Convex skeletons of complex networks. J. R. Soc. Interface 15(145), 20180422 (2018)","journal-title":"J. R. Soc. Interface"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18840-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T06:11:38Z","timestamp":1678515098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18840-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031188398","9783031188404"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18840-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montpellier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","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":"dis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2022.sciencesconf.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":"59","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":"27","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":"12","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":"46% - 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":"2.5","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":"2.5","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)"}}]}}