{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:44:58Z","timestamp":1778597098297,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_3","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"29-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity"],"prefix":"10.1007","author":[{"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clara","family":"Marcille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zin Mar","family":"Myint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. B.","family":"Sandeep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagnik","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Taruni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"issue":"7","key":"3_CR1","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1080\/0020716031000103376","volume":"80","author":"M Atici","year":"2003","unstructured":"Atici, M.: On the edge geodetic number of a graph. Int. J. Comput. Math. 80(7), 853\u2013861 (2003)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"3_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\u00f2, D., Drovandi, G., Gual\u00e0, L., Klasing, R., Proietti, G.: Network verification via routing table queries. J. Comput. Syst. Sci. 81(1), 234\u2013248 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"3_CR3","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova, Z., et al.: Network discovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bejerano, Y., Rastogi, R.: Robust monitoring of link delays and faults in IP networks. In: IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428), vol. 1, pp. 134\u2013144. IEEE (2003)","DOI":"10.1109\/INFCOM.2003.1208666"},{"issue":"14\u201315","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1016\/j.tcs.2010.01.010","volume":"411","author":"D Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, D., Erlebach, T., Mihal\u00e1k, M., Widmayer, P.: Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411(14\u201315), 1626\u20131637 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR6","unstructured":"Chakraborty, D., Das, S., Foucaud, F., Gahlawat, H., Lajou, D., Roy, B.: Algorithms and complexity for geodetic sets on planar and chordal graphs. In: Cao, Y., Cheng, S., Li, M. (eds.), 31st International Symposium on Algorithms and Computation, ISAAC 2020, 14\u201318 December 2020, Hong Kong, China (Virtual Conference), volume 181 of LIPIcs, pp. 7:1\u20137:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"3_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114217","volume":"979","author":"D Chakraborty","year":"2023","unstructured":"Chakraborty, D., Gahlawat, H., Roy, B.: Algorithms and complexity for geodetic sets on partial grids. Theor. Comput. Sci. 979, 114217 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Harary, F., Zhang, P.: On the geodetic number of a graph. Netw. Int. J. 39(1), 1\u20136 (2002)","DOI":"10.1002\/net.10007"},{"key":"3_CR9","first-page":"37","volume":"156","author":"G Chartrand","year":"2002","unstructured":"Chartrand, G., Palmer, E.M., Zhang, P.: The geodetic number of a graph: a survey. Congressus numerantium 156, 37\u201358 (2002)","journal-title":"Congressus numerantium"},{"issue":"1","key":"3_CR10","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. Theor. Comput. Sci. 355(1), 6\u201324 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-89543-3_7","volume-title":"Computing and Combinatorics","author":"T Davot","year":"2021","unstructured":"Davot, T., Isenmann, L., Thiebaut, J.: On the approximation hardness of geodetic set and its variants. In: Chen, C.-Y., Hon, W.-K., Hung, L.-J., Lee, C.-W. (eds.) COCOON 2021. LNCS, vol. 13025, pp. 76\u201388. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89543-3_7"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.disc.2009.09.018","volume":"310","author":"MC Dourado","year":"2010","unstructured":"Dourado, M.C., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: Some remarks on the geodetic number of a graph. Discret. Math. 310(4), 832\u2013837 (2010)","journal-title":"Discret. Math."},{"key":"3_CR13","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.-S., Klasing, R., Miller, M., Ryan, J.: Monitoring the edges of a graph using distances. Discret. Appl. Math. 319, 424\u2013438 (2022)","journal-title":"Discret. Appl. Math."},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Foucaud, F., Narayanan, K., Ramasubramony Sulochana, L.: Monitoring Edge-Geodetic Sets in Graphs. In: Bagchi, A., Muthu, R. (eds.) Algorithms and Discrete Applied Mathematics. CALDAM 2023. LNCS, vol. 13947, pp. 245\u2013256. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25211-2_19","DOI":"10.1007\/978-3-031-25211-2_19"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Govindan, R., Tangmunarunkit, H.: Heuristics for internet map discovery. In: Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No. 00CH37064), vol. 3, pp. 1371\u20131380. IEEE (2000)","DOI":"10.1109\/INFCOM.2000.832534"},{"issue":"11","key":"3_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary, F., Loukakis, E., Tsouros, C.: The geodetic number of a graph. Math. Comput. Model. 17(11), 89\u201395 (1993)","journal-title":"Math. Comput. Model."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2023.06.033","volume":"340","author":"J Haslegrave","year":"2023","unstructured":"Haslegrave, J.: Monitoring edge-geodetic sets: hardness and graph products. Discret. Appl. Math. 340, 79\u201384 (2023)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00373-018-1885-9","volume":"34","author":"V Ir\u0161i\u010d","year":"2018","unstructured":"Ir\u0161i\u010d, V.: Strong geodetic number of complete bipartite graphs and of graphs with specified diameter. Graphs Comb. 34(3), 443\u2013456 (2018)","journal-title":"Graphs Comb."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jctb.2012.09.001","volume":"103","author":"G Joret","year":"2013","unstructured":"Joret, G., Wood, D.R.: Complete graph minors and the graph minor structure theorem. J. Comb. Theory Ser. B 103(1), 61\u201374 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.7155\/jgaa.00601","volume":"26","author":"L Kellerhals","year":"2022","unstructured":"Kellerhals, L., Koana, T.: Parameterized complexity of geodetic set. J. Graph Algorithms Appl. 26(4), 401\u2013419 (2022)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0273-0979-05-01088-8","volume":"43","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L.: Graph minor theory. Bull. Am. Math. Soc. 43(1), 75\u201386 (2006)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1515\/math-2017-0101","volume":"15","author":"P Manuel","year":"2017","unstructured":"Manuel, P., Klav\u017ear, S., Xavier, A., Arokiaraj, A., Thomas, E.: Strong edge geodetic problem in networks. Open Math. 15(1), 1225\u20131235 (2017)","journal-title":"Open Math."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors: Xvii. taming a vortex. J. Comb. Theory Ser. B 77(1), 162\u2013210 (1999)","DOI":"10.1006\/jctb.1999.1919"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. xx. wagner\u2019s conjecture. J. Comb. Theory Ser. B 92(2), 325\u2013357 (2004)","DOI":"10.1016\/j.jctb.2004.08.001"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/09720529.2007.10698129","volume":"10","author":"A Santhakumaran","year":"2007","unstructured":"Santhakumaran, A., John, J.: Edge geodetic number of a graph. J. Discret. Math. Sci. Cryptogr. 10(3), 415\u2013432 (2007)","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"issue":"2","key":"3_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10(2), 297\u2013309 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:24Z","timestamp":1768281744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}