{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T13:41:06Z","timestamp":1765806066524,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_10","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"132-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distance-Based Covering Problems for\u00a0Graphs of\u00a0Given Cyclomatic Number"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0534-6417","authenticated-orcid":false,"given":"Dibyayan","family":"Chakraborty","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8198-693X","authenticated-orcid":false,"given":"Florent","family":"Foucaud","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7473-2456","authenticated-orcid":false,"given":"Anni","family":"Hakanen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0166-218X(94)00142-Z","volume":"62","author":"G Andreatta","year":"1995","unstructured":"Andreatta, G., Mason, F.: Path covering problems and testing of printed circuits. Disc. Appl. Math. 62(1), 5\u201313 (1995)","journal-title":"Disc. Appl. Math."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.7151\/dmgt.2139","volume":"40","author":"A Arokiaraj","year":"2020","unstructured":"Arokiaraj, A., Klav\u017ear, S., Manuel, P.D., Thomas, E., Xavier, A.: Strong geodetic problems in networks. Discussiones Mathematicae Graph Theory 40(1), 307\u2013321 (2020)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"7","key":"10_CR3","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."},{"doi-asserted-by":"crossref","unstructured":"C\u00e1ceres, M., Cairo, M., Mumey, B., Rizzi, R., Tomescu, A.I.: Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time. In: Proceedings of SODA 2022, pp. 359\u2013376. SIAM (2022)","key":"10_CR4","DOI":"10.1137\/1.9781611977073.18"},{"unstructured":"Chakraborty, D., Dailly, A., Das, S., Foucaud, F., Gahlawat, H., Ghosh, S.K.: Complexity and algorithms for isometric path cover on chordal graphs and beyond. In: Proceedings of ISAAC 2022, LIPIcs, vol. 248, pp. 12:1\u201312:17 (2022)","key":"10_CR5"},{"issue":"1\u20133","key":"10_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.: Resolvability in graphs and the metric dimension of a graph. Disc. Appl. Math. 105(1\u20133), 99\u2013113 (2000)","journal-title":"Disc. Appl. Math."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(85)90057-5","volume":"10","author":"D Coppersmith","year":"1985","unstructured":"Coppersmith, D., Vishkin, U.: Solving NP-hard problems in \u2018almost trees\u2019: vertex cover. Disc. Appl. Math. 10(1), 27\u201345 (1985)","journal-title":"Disc. Appl. Math."},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.7155\/jgaa.00360","volume":"19","author":"D Eppstein","year":"2015","unstructured":"Eppstein, D.: Metric dimension parameterized by max leaf number. J. Graph Algor. Appl. 19(1), 313\u2013323 (2015)","journal-title":"J. Graph Algor. Appl."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1007\/s00453-014-9896-2","volume":"72","author":"L Epstein","year":"2015","unstructured":"Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: Hard and easy cases. Algorithmica 72(4), 1130\u20131171 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR11","first-page":"97","volume":"38","author":"DC Fisher","year":"2001","unstructured":"Fisher, D.C., Fitzpatrick, S.L.: The isometric number of a graph. J. Comb. Math. Comb. Comput. 38(1), 97\u2013110 (2001)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10_CR12","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. Disc. Appl. Math. 319, 424\u2013438 (2022)","journal-title":"Disc. Appl. Math."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-030-39219-2_3","volume-title":"Algorithms and Discrete Applied Mathematics","author":"F Foucaud","year":"2020","unstructured":"Foucaud, F., Klasing, R., Miller, M., Ryan, J.: Monitoring the edges of a graph using distances. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 28\u201340. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_3"},{"doi-asserted-by":"publisher","unstructured":"Foucaud, F., Narayanan, K., Sulochana, L.R.: Monitoring edge-geodetic sets in graphs. In: Bagchi, A., Muthu, R. (eds.) Proceedings of CALDAM 2023. Lecture Notes in Computer Science, vol. 13947, pp. 245\u2013256. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-25211-2_19","key":"10_CR14","DOI":"10.1007\/978-3-031-25211-2_19"},{"issue":"11","key":"10_CR15","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":"10_CR16","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.: On the metric dimension of a graph. Ars Combinatoria 2, 191\u2013195 (1976)","journal-title":"Ars Combinatoria"},{"key":"10_CR17","first-page":"429","volume":"314","author":"A Kelenc","year":"2017","unstructured":"Kelenc, A., Kuziak, D., Taranenko, A., Yero, I.G.: Mixed metric dimension of graphs. Appl. Math. Comput. 314, 429\u2013438 (2017)","journal-title":"Appl. Math. Comput."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.dam.2018.05.052","volume":"251","author":"A Kelenc","year":"2018","unstructured":"Kelenc, A., Tratnik, N., Yero, I.G.: Uniquely identifying the edges of a graph: the edge metric dimension. Disc. Appl. Math. 251, 204\u2013220 (2018)","journal-title":"Disc. Appl. Math."},{"issue":"4","key":"10_CR19","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 Algor. Appl. 26(4), 401\u2013419 (2022)","journal-title":"J. Graph Algor. Appl."},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Disc. Appl. Math. 70(3), 217\u2013229 (1996)","journal-title":"Disc. Appl. Math."},{"key":"10_CR21","volume":"401","author":"M Knor","year":"2021","unstructured":"Knor, M., Majstorovi\u0107, S., Masa Toshi, A.T., \u0160krekovski, R., Yero, I.G.: Graphs with the edge metric dimension smaller than the metric dimension. Appl. Math. Comput. 401, 126076 (2021)","journal-title":"Appl. Math. Comput."},{"unstructured":"Kuziak, D., Yero, I.G.: Metric dimension related parameters in graphs: a survey on combinatorial, computational and applied results. arXiv preprint arXiv:2107.04877 (2021)","key":"10_CR22"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1007\/s10878-020-00575-3","volume":"44","author":"C Lu","year":"2022","unstructured":"Lu, C., Ye, Q., Zhu, C.: Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. J. Comb. Optim. 44, 2029\u20132039 (2022)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10_CR24","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."},{"unstructured":"Manuel, P.D.: Revisiting path-type covering and partitioning problems. arXiv preprint arXiv:1807.10613 (2018)","key":"10_CR25"},{"issue":"5","key":"10_CR26","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TSE.1979.234213","volume":"5","author":"S Ntafos","year":"1979","unstructured":"Ntafos, S., Hakimi, S.: On path cover problems in digraphs and applications to program testing. IEEE Trans. Softw. Eng. SE 5(5), 520\u2013529 (1979)","journal-title":"IEEE Trans. Softw. Eng. SE"},{"key":"10_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8699-2","volume-title":"Geodesic Convexity in Graphs","author":"IM Pelayo","year":"2013","unstructured":"Pelayo, I.M.: Geodesic Convexity in Graphs. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4614-8699-2"},{"key":"10_CR28","first-page":"125908","volume":"396","author":"J Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Bounds on metric dimensions of graphs with edge disjoint cycles. Appl. Math. Comput. 396, 125908 (2021)","journal-title":"Appl. Math. Comput."},{"key":"10_CR29","first-page":"126238","volume":"404","author":"J Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Extremal mixed metric dimension with respect to the cyclomatic number. Appl. Math. Comput. 404, 126238 (2021)","journal-title":"Appl. Math. Comput."},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2021.05.004","volume":"300","author":"J Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Mixed metric dimension of graphs with edge disjoint cycles. Disc. Appl. Math. 300, 1\u20138 (2021)","journal-title":"Disc. Appl. Math."},{"key":"10_CR31","first-page":"127147","volume":"427","author":"J Sedlar","year":"2022","unstructured":"Sedlar, J., \u0160krekovski, R.: Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two. Appl. Math. Comput. 427, 127147 (2022)","journal-title":"Appl. Math. Comput."},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2022.05.008","volume":"320","author":"J Sedlar","year":"2022","unstructured":"Sedlar, J., \u0160krekovski, R.: Vertex and edge metric dimensions of cacti. Disc. Appl. Math. 320, 126\u2013139 (2022)","journal-title":"Disc. Appl. Math."},{"unstructured":"Slater, P.J.: Leaves of trees. In: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1975), pp. 549\u2013559. Congressus Numerantium, No. XIV. Utilitas Math., Winnipeg, Man. (1975)","key":"10_CR33"},{"unstructured":"Tillquist, R.C., Frongillo, R.M., Lladser, M.E.: Getting the lay of the land in discrete space: a survey of metric dimension and its applications. arXiv preprint arXiv:2104.07201 (2021)","key":"10_CR34"},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2013.01.029","volume":"494","author":"J Uhlmann","year":"2013","unstructured":"Uhlmann, J., Weller, M.: Two-layer planarization parameterized by feedback edge set. Theor. Comput. Sci. 494, 99\u2013111 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"10_CR36","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1016\/j.disc.2018.04.010","volume":"341","author":"N Zubrilina","year":"2018","unstructured":"Zubrilina, N.: On the edge dimension of a graph. Disc. Math. 341(7), 2083\u20132088 (2018)","journal-title":"Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:36:08Z","timestamp":1699911368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}