{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:37:46Z","timestamp":1743100666901,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030440374"},{"type":"electronic","value":"9783030440381"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-44038-1_84","type":"book-chapter","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T09:04:07Z","timestamp":1585559047000},"page":"926-936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Building Networks with Limited Stretch Factor"],"prefix":"10.1007","author":[{"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,31]]},"reference":[{"key":"84_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2017.09.005","volume":"704","author":"MA Abam","year":"2017","unstructured":"Abam, M.A., Baharifard, F., Borouny, M.S., Zarrabi-Zadeh, H.: Fault-tolerant spanners in networks with symmetric directional antennas. Theor. Comput. Sci. 704, 18\u201327 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"84_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"HJ Bandelt","year":"1986","unstructured":"Bandelt, H.J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"9","key":"84_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.comgeo.2011.05.003","volume":"44","author":"P Carmi","year":"2011","unstructured":"Carmi, P., Katz, M.J., Lotker, Z., Ros\u00e9n, A.: Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9), 477\u2013485 (2011)","journal-title":"Comput. Geom."},{"key":"84_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.endm.2011.05.064","volume":"37","author":"S Cicerone","year":"2011","unstructured":"Cicerone, S.: Characterizations of graphs with stretch number less than 2. Electron. Notes Discret. Math. 37, 375\u2013380 (2011)","journal-title":"Electron. Notes Discret. Math."},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"Cicerone, S.: Using split composition to extend distance-hereditary graphs in a generative way - (extended abstract). In: International Conference on Theory and Applications of Models of Computation (TAMC 2011), Lecture Notes in Computer Science, vol. 6648, pp. 286\u2013297. Springer (2011)","DOI":"10.1007\/978-3-642-20877-5_29"},{"key":"84_CR6","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Cermignani, M.: Fast and simple approach for polygon schematization. In: 12th International Conference on Computational Science and Its Applications (ICCSA 2012), LNCS, vol. 7333, pp. 267\u2013279. Springer (2012)","DOI":"10.1007\/978-3-642-31125-3_21"},{"key":"84_CR7","doi-asserted-by":"crossref","unstructured":"Cicerone, S., D\u2019Ermiliis, G., Di Stefano, G.: (k, +)-distance-hereditary graphs. In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Lecture Notes in Computer Science, vol. 2204, pp. 66\u201377. Springer (2001)","DOI":"10.1007\/3-540-45477-2_8"},{"issue":"1\u20133","key":"84_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(99)00075-X","volume":"95","author":"S Cicerone","year":"1999","unstructured":"Cicerone, S., Di Stefano, G.: Graph classes between parity and distance-hereditary graphs. Discret. Appl. Math. 95(1\u20133), 197\u2013216 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"84_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(99)00074-8","volume":"95","author":"S Cicerone","year":"1999","unstructured":"Cicerone, S., Di Stefano, G.: On the extension of bipartite to parity graphs. Discret. Appl. Math. 95(1\u20133), 181\u2013195 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20132","key":"84_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00227-4","volume":"108","author":"S Cicerone","year":"2001","unstructured":"Cicerone, S., Di Stefano, G.: Graphs with bounded induced distance. Discret. Appl. Math. 108(1\u20132), 3\u201321 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"3\u20134","key":"84_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S1570-8667(03)00030-3","volume":"1","author":"S Cicerone","year":"2003","unstructured":"Cicerone, S., Di Stefano, G.: (k, +)-distance-hereditary graphs. J. Discret. Algorithms 1(3\u20134), 281\u2013302 (2003)","journal-title":"J. Discret. Algorithms"},{"issue":"4","key":"84_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.jda.2004.04.002","volume":"2","author":"S Cicerone","year":"2004","unstructured":"Cicerone, S., Di Stefano, G.: Networks with small stretch number. J. Discret. Algorithms 2(4), 383\u2013405 (2004)","journal-title":"J. Discret. Algorithms"},{"issue":"10","key":"84_CR13","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1006\/jpdc.2001.1728","volume":"61","author":"S Cicerone","year":"2001","unstructured":"Cicerone, S., Di Stefano, G., Flammini, M.: Compact-port routing models and applications to distance-hereditary graphs. J. Parallel Distrib. Comput. 61(10), 1472\u20131488 (2001)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1\u20133","key":"84_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2005.04.004","volume":"150","author":"S Cicerone","year":"2005","unstructured":"Cicerone, S., Di Stefano, G., Handke, D.: Self-spanner graphs. Discret. Appl. Math. 150(1\u20133), 99\u2013120 (2005)","journal-title":"Discret. Appl. Math."},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Minimum-traveled-distance gathering of oblivious robots over given meeting-points. In: Proceedings of 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Algosensors), LNCS, vol. 8847, pp. 57\u201372. Springer (2014)","DOI":"10.1007\/978-3-662-46018-4_4"},{"key":"84_CR16","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Minmax-distance gathering on given meeting-points. In: Proceedings of 9th International Conference on Algorithms and Complexity (CIAC), LNCS, vol. 9079, pp. 127\u2013139. Springer (2015)","DOI":"10.1007\/978-3-319-18173-8_9"},{"issue":"1","key":"84_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-017-0293-3","volume":"31","author":"S Cicerone","year":"2018","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distrib. Comput. 31(1), 1\u201350 (2018)","journal-title":"Distrib. Comput."},{"issue":"2","key":"84_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00446-018-0325-7","volume":"32","author":"S Cicerone","year":"2019","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Asynchronous arbitrary pattern formation: the effects of a rigorous approach. Distrib. Comput. 32(2), 91\u2013132 (2019)","journal-title":"Distrib. Comput."},{"issue":"2","key":"84_CR19","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"WH Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM. J. Algebr. Discret. Methods 3(2), 214\u2013228 (1982)","journal-title":"SIAM. J. Algebr. Discret. Methods"},{"issue":"2","key":"84_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205\u2013240 (2000)","journal-title":"J. Algorithms"},{"issue":"3","key":"84_CR21","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"CP Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.L.: Recognizing circle graphs in polynomial time. J. ACM 36(3), 435\u2013473 (1989)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"84_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"PL Hammer","year":"1990","unstructured":"Hammer, P.L., Maffray, F.: Completely separable graphs. Discret. Appl. Math. 27(1\u20132), 85\u201399 (1990)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"84_CR23","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E Howorka","year":"1977","unstructured":"Howorka, E.: Distance-hereditary graphs. Q. J. Math. 28(4), 417\u2013420 (1977)","journal-title":"Q. J. Math."},{"key":"84_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2015.04.035","volume":"590","author":"E Kranakis","year":"2015","unstructured":"Kranakis, E., MacQuarrie, F., Ponce, O.M.: Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae. Theor. Comput. Sci. 590, 55\u201372 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"84_CR25","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TCOM.1980.1094721","volume":"28","author":"J McQuillan","year":"1980","unstructured":"McQuillan, J., Richer, I., Rosen, E.: The new routing algorithm for the ARPANET. IEEE Trans. Commun. 28(5), 711\u2013719 (1980)","journal-title":"IEEE Trans. Commun."},{"key":"84_CR26","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1109\/TCOM.1979.1094552","volume":"27","author":"P Merlin","year":"1979","unstructured":"Merlin, P., Segall, A.: A failsafe distributed routing protocol. IEEE Trans. Commun. 27, 1280\u20131287 (1979)","journal-title":"IEEE Trans. Commun."},{"issue":"14","key":"84_CR27","doi-asserted-by":"publisher","first-page":"2768","DOI":"10.1016\/j.dam.2007.11.013","volume":"156","author":"M Rao","year":"2008","unstructured":"Rao, M.: Solving some NP-complete problems using split decomposition. Discret. Appl. Math. 156(14), 2768\u20132780 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"84_CR28","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TCOM.1980.1094690","volume":"28","author":"M Schwartz","year":"1980","unstructured":"Schwartz, M., Stern, T.E.: Routing techniques used in computer communication networks. IEEE Trans. Commun. 28(4), 539\u2013552 (1980)","journal-title":"IEEE Trans. Commun."}],"container-title":["Advances in Intelligent Systems and Computing","Web, Artificial Intelligence and Network Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44038-1_84","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T20:25:15Z","timestamp":1669321515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-44038-1_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030440374","9783030440381"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44038-1_84","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshops of  the International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Caserta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waina0a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}