{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:11:51Z","timestamp":1742911911829,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_11","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:11Z","timestamp":1740067211000},"page":"160-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Uniform Shortest Path Sampling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8844-2848","authenticated-orcid":false,"given":"Simon","family":"Dreyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5480-0236","authenticated-orcid":false,"given":"Antoine","family":"Genitrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2735-2420","authenticated-orcid":false,"given":"Mehdi","family":"Naima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538902.1538905","volume":"56","author":"D Achlioptas","year":"2009","unstructured":"Achlioptas, D., Clauset, A., Kempe, D., Moore, C.: On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. J. ACM 56(4), 1\u201328 (2009)","journal-title":"J. ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","volume":"65","author":"G Boeing","year":"2017","unstructured":"Boeing, G.: OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urban Syst. 65, 126\u2013139 (2017)","journal-title":"Comput. Environ. Urban Syst."},{"issue":"2","key":"11_CR3","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."},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"052816","DOI":"10.1103\/PhysRevE.89.052816","volume":"89","author":"F Ciulla","year":"2014","unstructured":"Ciulla, F., Perra, N., Baronchelli, A., Vespignani, A.: Damage detection via shortest-path network sampling. Phys. Rev. E 89(5), 052816 (2014)","journal-title":"Phys. Rev. E"},{"key":"11_CR5","unstructured":"Clauset, A., Moore, C.: Traceroute sampling makes random graphs appear to have power law degree distributions. arXiv preprint cond-mat\/0312674 (2003)"},{"issue":"5","key":"11_CR6","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.comcom.2010.06.006","volume":"34","author":"C Crespelle","year":"2011","unstructured":"Crespelle, C., Tarissan, F.: Evaluation of a new method for measuring the internet degree distribution: simulation results. Comput. Commun. 34(5), 635\u2013648 (2011)","journal-title":"Comput. Commun."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.tcs.2005.12.009","volume":"355","author":"L Dall\u2019Asta","year":"2006","unstructured":"Dall\u2019Asta, L., Alvarez-Hamelin, I., Barrat, A., V\u00e1zquez, A., Vespignani, A.: Exploring networks with traceroute-like probes: theory and simulations. Theoret. Comput. Sci. 355(1), 6\u201324 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmermann, P., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theoret. Comput. Sci. 132(1\u20132), 1\u201335 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Flaxman, A.D., Vera, J.: Bias reduction in traceroute sampling\u2013towards a more accurate map of the internet. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 1\u201315. Springer (2007)","DOI":"10.1007\/978-3-540-77004-6_1"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.01.014","volume":"912","author":"A Genitrini","year":"2022","unstructured":"Genitrini, A., P\u00e9pin, M., Peschanski, F.: A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space. Theor. Comput. Sci. 912, 1\u201336 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Guillaume, J.L., Latapy, M.: Relevance of massively distributed explorations of the internet topology: Simulation results. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a02, pp. 1084\u20131094. IEEE (2005)","DOI":"10.1109\/INFCOM.2005.1498336"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press (1999)","DOI":"10.1145\/309739.309744"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Lakhina, A., Byers, J.W., Crovella, M., Xie, P.: Sampling biases in IP topology measurements. In: IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies, vol.\u00a01, pp. 332\u2013341. IEEE (2003)","DOI":"10.1109\/INFCOM.2003.1208685"},{"issue":"8","key":"11_CR15","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1016\/j.comnet.2006.10.008","volume":"51","author":"J Leguay","year":"2007","unstructured":"Leguay, J., Latapy, M., Friedman, T., Salamatian, K.: Describing and simulating internet routes. Comput. Netw. 51(8), 2067\u20132085 (2007)","journal-title":"Comput. Netw."},{"key":"11_CR16","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms. Computer Science and Applied Mathematics. Academic Press, New York (1975)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1140\/epjb\/e2004-00021-5","volume":"38","author":"T Petermann","year":"2004","unstructured":"Petermann, T., De Los Rios, P.: Exploration of scale-free networks: do we measure the real exponents? Eur. Phys. J. B 38, 201\u2013204 (2004)","journal-title":"Eur. Phys. J. B"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"18007","DOI":"10.1209\/0295-5075\/89\/18007","volume":"89","author":"M P\u00f3sfai","year":"2010","unstructured":"P\u00f3sfai, M., Fekete, A., Vattay, G.: Shortest-path sampling of dense homogeneous networks. Europhys. Lett. 89(1), 18007 (2010)","journal-title":"Europhys. Lett."},{"key":"11_CR19","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer (2012)"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.physa.2015.01.030","volume":"424","author":"A Rezvanian","year":"2015","unstructured":"Rezvanian, A., Meybodi, M.R.: Sampling social networks using shortest paths. Phys. A: Stat. Mech. Appl. 424, 254\u2013268 (2015)","journal-title":"Phys. A: Stat. Mech. Appl."},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. (CSUR) 46(4), 1\u201331 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"10","key":"11_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1049\/el:19740097","volume":"8","author":"AJ Walker","year":"1974","unstructured":"Walker, A.J.: New fast method for generating discrete random numbers with arbitrary frequency distributions. Electron. Lett. 8(10), 127\u2013128 (1974)","journal-title":"Electron. Lett."},{"issue":"6","key":"11_CR23","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1016\/j.comnet.2009.10.023","volume":"54","author":"H Wang","year":"2010","unstructured":"Wang, H., Van Mieghem, P.: Sampling networks by the union of m shortest path trees. Comput. Netw. 54(6), 1042\u20131053 (2010)","journal-title":"Comput. Netw."},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.physa.2010.09.022","volume":"390","author":"GQ Zhang","year":"2011","unstructured":"Zhang, G.Q., Zhou, S., Wang, D., Yan, G., Zhang, G.Q.: Enhancing network transmission capacity by efficiently allocating node capability. Phys. A: Stat. Mech. Appl. 390(2), 387\u2013391 (2011)","journal-title":"Phys. A: Stat. Mech. Appl."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:18Z","timestamp":1740067218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}