{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:14:25Z","timestamp":1743005665646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_14","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"175-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6881-7832","authenticated-orcid":false,"given":"Duygu","family":"Vietz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1057383","volume":"31","author":"R Belmonte","year":"2017","unstructured":"Belmonte, R., Fomin, F.V., Golovach, P.A., Ramanujan, M.: Metric dimension of bounded tree-length graphs. SIAM J. Discret. Math. 31(2), 1217\u20131243 (2017)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"14_CR2","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., Oellermann, O.: Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105(1\u20133), 99\u2013113 (2000)","journal-title":"Discret. Appl. Math."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-33090-2_37","volume-title":"Algorithms \u2013 ESA 2012","author":"J D\u00edaz","year":"2012","unstructured":"D\u00edaz, J., Pottonen, O., Serna, M., van Leeuwen, E.J.: On the complexity of metric dimension. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 419\u2013430. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_37"},{"issue":"4","key":"14_CR4","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"},{"key":"14_CR5","unstructured":"Estrada-Moreno, A., Rodr\u00edguez-Vel\u00e1zquez, J.A., Yero, I.G.: The k-metric dimension of a graph. arXiv preprint arXiv:1312.6840 (2013)"},{"issue":"9","key":"14_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.ipl.2015.04.006","volume":"115","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Heggernes, P., van\u2019t Hof, P., Meister, D., Saei, R.: Computing the metric dimension for chain graphs. Inf. Process. Lett. 115(9), 671\u2013676 (2015)","journal-title":"Inf. Process. Lett."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-662-53174-7_32","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F Foucaud","year":"2016","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 456\u2013471. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_32"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2017.01.006","volume":"668","author":"F Foucaud","year":"2017","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. 668, 43\u201358 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"14_CR10","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":"14_CR11","doi-asserted-by":"crossref","unstructured":"Hartung, S., Nichterlein, A.: On the parameterized and approximation hardness of metric dimension. In: 2013 IEEE Conference on Computational Complexity (CCC), pp. 266\u2013276. IEEE (2013)","DOI":"10.1109\/CCC.2013.36"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jda.2011.12.010","volume":"14","author":"M Hauptmann","year":"2012","unstructured":"Hauptmann, M., Schmied, R., Viehmann, C.: Approximation complexity of metric dimension problem. J. Discret. Algorithms 14, 214\u2013222 (2012)","journal-title":"J. Discret. Algorithms"},{"key":"14_CR13","first-page":"81","volume":"5","author":"C Hernando","year":"2008","unstructured":"Hernando, C., Mora, M., Slater, P.J., Wood, D.R.: Fault-tolerant metric dimension of graphs. Convexity Discret. Struct. 5, 81\u201385 (2008)","journal-title":"Convexity Discret. Struct."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.endm.2005.06.023","volume":"22","author":"M Hernando","year":"2005","unstructured":"Hernando, M., Mora, M., Pelayo, I., Seara, C., C\u00e1ceres, J., Puertas, M.: On the metric dimension of some families of graphs. Electron. Notes Discret. Math. 22, 129\u2013133 (2005)","journal-title":"Electron. Notes Discret. Math."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-36092-3_10","volume-title":"Algorithms for Sensor Systems","author":"S Hoffmann","year":"2013","unstructured":"Hoffmann, S., Wanke, E.: Metric Dimension for Gabriel unit disk graphs is NP-complete. In: Bar-Noy, A., Halld\u00f3rsson, M.M. (eds.) ALGOSENSORS 2012. LNCS, vol. 7718, pp. 90\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36092-3_10"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2016.03.024","volume":"630","author":"S Hoffmann","year":"2016","unstructured":"Hoffmann, S., Elterman, A., Wanke, E.: A linear time algorithm for metric dimension of cactus block graphs. Theor. Comput. Sci. 630, 43\u201362 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR17","first-page":"19","volume":"41","author":"H Iswadi","year":"2010","unstructured":"Iswadi, H., Baskoro, E., Salman, A., Simanjuntak, R.: The metric dimension of amalgamation of cycles. Far East J. Math. Sci. (FJMS) 41(1), 19\u201331 (2010)","journal-title":"Far East J. Math. Sci. (FJMS)"},{"key":"14_CR18","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. Discret. Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"OR Oellermann","year":"2007","unstructured":"Oellermann, O.R., Peters-Fransen, J.: The strong metric dimension of graphs and digraphs. Discret. Appl. Math. 155(3), 356\u2013364 (2007)","journal-title":"Discret. Appl. Math."},{"key":"14_CR20","unstructured":"Saputro, S., Baskoro, E., Salman, A., Suprijanto, D., Baca, A.: The metric dimension of regular bipartite graphs. arXiv\/1101.3624 (2011). http:\/\/arxiv.org\/abs\/1101.3624"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A Seb\u00f6","year":"2004","unstructured":"Seb\u00f6, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29(2), 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"14_CR22","first-page":"549","volume":"14","author":"P Slater","year":"1975","unstructured":"Slater, P.: Leaves of trees. Congr. Numer. 14, 549\u2013559 (1975)","journal-title":"Congr. Numer."}],"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-3-030-10564-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:51:00Z","timestamp":1709823060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_14"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","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 Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"30% - 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":"9.8","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)"}}]}}