{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:43:46Z","timestamp":1778597026824,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00236-024-00453-z","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T13:02:33Z","timestamp":1710853353000},"page":"183-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Distance-edge-monitoring sets of networks"],"prefix":"10.1007","volume":"61","author":[{"given":"Gang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiannan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changxiang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,19]]},"reference":[{"issue":"14\u201315","key":"453_CR1","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1016\/j.tcs.2010.01.010","volume":"411","author":"D Bil\u00f3","year":"2010","unstructured":"Bil\u00f3, D., Erlebach, T., Mihal\u00e1k, M., Widmayer, P.: Discovery of network properties with all-shortest-paths queries. Theoret. Comput. Sci. 411(14\u201315), 1626\u20131637 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"453_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jcss.2014.06.003","volume":"81","author":"E Bampas","year":"2015","unstructured":"Bampas, E., Bil\u00f3, D., Drovandi, G., Gual\u00e1, L., Klasing, R., Proietti, G.: Network verification via routing table queries. J. Comput. System Sci. 81(1), 234\u2013248 (2015)","journal-title":"J. Comput. System Sci."},{"issue":"12","key":"453_CR3","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal\u00e1k, M., Ram, L.S.: Network discovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"11","key":"453_CR4","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1016\/j.physa.2009.02.004","volume":"388","author":"F Comellas","year":"2009","unstructured":"Comellas, F., Miralles, A.: Modeling complex networks with self-similar outerplanar unclustered graphs. Phys. A 388(11), 2227\u20132233 (2009)","journal-title":"Phys. A"},{"issue":"12","key":"453_CR5","doi-asserted-by":"publisher","first-page":"2803","DOI":"10.1016\/j.physa.2012.10.047","volume":"392","author":"F Comellas","year":"2013","unstructured":"Comellas, F., Miralles, A., Liu, H., Zhang, Z.: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. Phys. A 392(12), 2803\u20132806 (2013)","journal-title":"Phys. A"},{"issue":"1","key":"453_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.3745\/JIPS.2011.7.1.075","volume":"7","author":"J-H Chang","year":"2011","unstructured":"Chang, J.-H.: An embedding of multiple edge-disjoint Hamiltonian cycles on enhanced pyramid graphs. J. Inform. Process. Syst. 7(1), 75\u201384 (2011)","journal-title":"J. Inform. Process. Syst."},{"key":"453_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/12.743415","volume":"48","author":"F Cao","year":"1999","unstructured":"Cao, F., Hsu, D.F.: Fault-tolerance properties of pyramid networks. IEEE Trans. Comput. 48, 88\u201393 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"453_CR8","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, J.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":"42","key":"453_CR9","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/42\/42\/425001","volume":"42","author":"C Francesc","year":"2009","unstructured":"Francesc, C., Alicia, M.: Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks. J. Phys. A: Math. Theor. 42(42), 425001 (2009)","journal-title":"J. Phys. A: Math. Theor."},{"key":"453_CR10","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.dam.2021.07.002","volume":"319","author":"F Foucaud","year":"2022","unstructured":"Foucaud, F., Kao, S., Klasing, R., Miller, M., Ryan, J.: Monitoring the edges of a graph using distances. Discrete Appl. Math. 319, 424\u2013438 (2022)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"453_CR11","first-page":"58","volume":"63","author":"J Geetha","year":"2015","unstructured":"Geetha, J., Somasundaram, K.: Total coloring of generalized Sierpi\u0144ski graphs. Australas. J. Combin. 63(1), 58\u201369 (2015)","journal-title":"Australas. J. Combin."},{"key":"453_CR12","doi-asserted-by":"crossref","unstructured":"Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: Proc. IEEE INFOCOM Conf. Comput. Commun. 19th Annu. Joint Conf. IEEE Comput. Commun. Soc., vol. 3. Tel Aviv, Israel, pp. 1371\u20131380 (2000)","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"453_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11227-006-4598-4","volume":"37","author":"MR Hoseinyfarahabady","year":"2006","unstructured":"Hoseinyfarahabady, M.R., Sarbazi-azad, H.: The grid-pyramid: a generalized pyramid network. J. Supercomput. 37, 23\u201345 (2006)","journal-title":"J. Supercomput."},{"issue":"1","key":"453_CR14","first-page":"154","volume":"195","author":"JS-T Juan","year":"2008","unstructured":"Juan, J.S.-T., Huang, C.-M.: On the strong distance problems of pyramid networks. Appl. Math. Comput. 195(1), 154\u2013161 (2008)","journal-title":"Appl. Math. Comput."},{"key":"453_CR15","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/71.250106","volume":"4","author":"J-F Jeng","year":"1993","unstructured":"Jeng, J.-F., Sahni, S.: Image shrinking and expanding on a pyramid. IEEE Trans. Parallel Distrib. Syst. 4, 1291\u20131296 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"453_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/0216004","volume":"16","author":"R Miller","year":"1987","unstructured":"Miller, R., Stout, Q.: Data movement techniques for the pyramid computer. SIAM J. Comput. 16, 38\u201360 (1987)","journal-title":"SIAM J. Comput."},{"key":"453_CR17","first-page":"181","volume":"35","author":"AM Teguia","year":"2006","unstructured":"Teguia, A.M., Godbole, A.P.: Sierpi\u0144ski gasket graphs and some of their properties. Australas. J. Combin. 35, 181\u2013192 (2006)","journal-title":"Australas. J. Combin."},{"issue":"1","key":"453_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1140\/epjb\/e2008-00305-8","volume":"65","author":"Z Zhang","year":"2008","unstructured":"Zhang, Z., Zhou, S., Su, Z., et al.: Random Sierpi\u0144ski network with scale-free small-world and modular structure. Eur. Phys. J. B 65(1), 141\u2013147 (2008)","journal-title":"Eur. Phys. J. B"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00453-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00453-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00453-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T11:45:13Z","timestamp":1731584713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00453-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,19]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["453"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00453-z","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3318584\/v1","asserted-by":"object"}]},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,19]]},"assertion":[{"value":"2 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}