{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T17:06:22Z","timestamp":1763831182684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653460"},{"type":"electronic","value":"9783030653477"}],"license":[{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65347-7_16","type":"book-chapter","created":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T07:03:42Z","timestamp":1608361422000},"page":"189-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Distances on a Graph"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Miasnikof","sequence":"first","affiliation":[]},{"given":"Alexander Y.","family":"Shestopaloff","sequence":"additional","affiliation":[]},{"given":"Leonidas","family":"Pitsoulis","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Ponomarenko","sequence":"additional","affiliation":[]},{"given":"Yuri","family":"Lawryshyn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,20]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fphy.2019.00048","volume":"7","author":"M Aramon","year":"2019","unstructured":"Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., Katzgraber, H.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019). https:\/\/doi.org\/10.3389\/fphy.2019.00048","journal-title":"Front. Phys."},{"key":"16_CR2","unstructured":"Bauckhage, C., Piatkowski, N., Sifa, R., Hecker, D., Wrobel, S.: A QUBO formulation of the k-medoids problem. In: J\u00e4schke, R., Weidlich, M. (eds.) Proceedings of the Conference on Lernen, Wissen, Daten, Analysen, CEUR Workshop Proceedings, Berlin, Germany, 30 September\u20132 October 2019, vol. 2454, pp. 54\u201363. CEUR-WS.org (2019). http:\/\/ceur-ws.org\/Vol-2454\/paper_39.pdf"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.2307\/2577097","volume":"55","author":"R Burt","year":"1976","unstructured":"Burt, R.: Positions in networks. Soc. Forces 55(1), 93\u2013122 (1976)","journal-title":"Soc. Forces"},{"key":"16_CR4","unstructured":"Camby, E., Caporossi, G.: The extended Jaccard distance in complex networks. Les Cahiers du GERAD G-2017-77 (September 2017)"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10898-009-9520-1","volume":"48","author":"N Fan","year":"2010","unstructured":"Fan, N., Pardalos, P.: Linear and quadratic programming approaches for the general graph partitioning problem. J. Glob. Optim. 48(1), 57\u201371 (2010). https:\/\/doi.org\/10.1007\/s10898-009-9520-1","journal-title":"J. Glob. Optim."},{"key":"16_CR6","unstructured":"Fan, N., Pardalos, P.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: Proceedings of the 4th International Conference on Combinatorial Optimization and Applications - Volume Part I, COCOA 2010, pp. 170\u2013183. Springer, Heidelberg (2010). http:\/\/dl.acm.org\/citation.cfm?id=1940390.1940405"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"16_CR8","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. 104(1), 36\u201341 (2007). http:\/\/www.pnas.org\/content\/104\/1\/36.abstract"},{"issue":"9","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1088\/0305-4470\/19\/9\/033","volume":"19","author":"Y Fu","year":"1986","unstructured":"Fu, Y., Anderson, P.: Application of statistical mechanics to NP-complete problems in combinatorial optimisation. J. Phys. A Math. Gen. 19(9), 1605\u20131620 (1986)","journal-title":"J. Phys. A Math. Gen."},{"key":"16_CR10","unstructured":"Glover, F., Kochenberger, G., Du, Y.: A Tutorial on Formulating and Using QUBO Models. arXiv e-prints arXiv:1811.11538 (June 2018)"},{"key":"16_CR11","unstructured":"Hagberg, A., Schult, D., Swart, P.: Exploring network structure, dynamics, and function using networkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, Pasadena, CA, USA, pp. 11\u201315 (2008)"},{"key":"16_CR12","unstructured":"Jaccard, P.: \u00c9tude de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 37, 547\u2013579 (1901)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Levandowsky, M., Winter, D.: Distance between sets. Nature 234 (1971)","DOI":"10.1038\/234034a0"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"key":"16_CR15","unstructured":"von Luxburg, U., Radl, A., Hein, M.: Getting lost in space: large sample analysis of the resistance distance. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.) Advances in Neural Information Processing Systems, vol. 23, pp. 2622\u20132630. Curran Associates, Inc. (2010). http:\/\/papers.nips.cc\/paper\/3891-getting-lost-in-space-large-sample-analysis-of-the-resistance-distance.pdf"},{"key":"16_CR16","unstructured":"von Luxburg, U., Radl, A., Hein, M.: Hitting and commute times in large random neighborhood graphs. J. Mach. Learn. Res. 15(52), 1751\u20131798 (2014). http:\/\/jmlr.org\/papers\/v15\/vonluxburg14a.html"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Miasnikof, P., Shestopaloff, A., Bonner, A., Lawryshyn, Y.: A statistical performance analysis of graph clustering algorithms, Chap.\u00a011. Lecture Notes in Computer Science. Springer Nature (June 2018)","DOI":"10.1007\/978-3-319-92871-5_11"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Miasnikof, P., Shestopaloff, A., Bonner, A., Lawryshyn, Y., Pardalos, P.: A density-based statistical analysis of graph clustering algorithm performance. J. Complex Netw. 8(3), cnaa012 (2020). https:\/\/doi.org\/10.1093\/comnet\/cnaa012","DOI":"10.1093\/comnet\/cnaa012"},{"issue":"9","key":"16_CR19","doi-asserted-by":"publisher","first-page":"522","DOI":"10.2331\/suisan.22.522","volume":"22","author":"A Ochiai","year":"1957","unstructured":"Ochiai, A.: Zoogeographical studies on the Soleoid fishes found in Japan and its neighbouring regions-i. Nippon Suisan Gakkaishi 22(9), 522\u2013525 (1957)","journal-title":"Nippon Suisan Gakkaishi"},{"key":"16_CR20","unstructured":"Ponomarenko, A., Pitsoulis, L.S., Shamshetdinov, M.: Overlapping community detection in networks based on link partitioning and partitioning around medoids. CoRR abs\/1907.08731 (2019). http:\/\/arxiv.org\/abs\/1907.08731"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Prokhorenkova, L.O., Pra\u0142at, P., Raigorodskii, A.: Modularity of complex networks models. In: Bonato, A., Graham, F., Pra\u0142at, P. (eds.) Algorithms and Models for the Web Graph, pp. 115\u2013126. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-49787-7_10"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Prokhorenkova, L.O., Pra\u0142at, P., Raigorodskii, A.: Modularity in several random graph models. Electro. Notes Discrete Math. 61, 947\u2013953 (2017), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065317302238. The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2017)","DOI":"10.1016\/j.endm.2017.07.058"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Schaeffer, S.: Survey: graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","DOI":"10.1016\/j.cosrev.2007.05.001"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65347-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T07:11:05Z","timestamp":1608361865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65347-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,20]]},"ISBN":["9783030653460","9783030653477"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65347-7_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2020,12,20]]},"assertion":[{"value":"20 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}