{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:21:31Z","timestamp":1743020491443,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_44","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"568-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Fractional k-truncated Metric Dimension of\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7493-8398","authenticated-orcid":false,"given":"Eunjeong","family":"Yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1016\/j.disc.2011.05.039","volume":"312","author":"S Arumugam","year":"2012","unstructured":"Arumugam, S., Mathew, V.: The fractional metric dimension of graphs. Discrete Math. 312, 1584\u20131590 (2012)","journal-title":"Discrete Math."},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"1350037","DOI":"10.1142\/S1793830913500377","volume":"5","author":"S Arumugam","year":"2013","unstructured":"Arumugam, S., Mathew, V., Shen, J.: On fractional metric dimension of graphs. Discrete Math. Algorithms Appl. 5, 1350037 (2013)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.26493\/1855-3974.1281.c7f","volume":"16","author":"AF Beardon","year":"2019","unstructured":"Beardon, A.F., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the $$k$$-metric dimension of metric spaces. Ars Math. Contemp. 16, 25\u201338 (2019)","journal-title":"Ars Math. Contemp."},{"key":"44_CR4","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.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105, 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"key":"44_CR5","first-page":"157","volume":"39","author":"J Currie","year":"2001","unstructured":"Currie, J., Oellermann, O.R.: The metric dimension and metric independence of a graph. J. Combin. Math. Combin. Comput. 39, 157\u2013167 (2001)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"3","key":"44_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.21136\/MB.2014.143937","volume":"139","author":"L Eroh","year":"2014","unstructured":"Eroh, L., Kang, C.X., Yi, E.: Metric dimension and zero forcing number of two families of line graphs. Math. Bohem. 139(3), 467\u2013483 (2014)","journal-title":"Math. Bohem."},{"key":"44_CR7","unstructured":"Estrada-Moreno, A.: On the ($$k, t$$)-metric dimension of a graph. Dissertation, Universitat Rovira i Virgili (2016)"},{"issue":"5","key":"44_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1093\/comjnl\/bxaa009","volume":"64","author":"A Estrada-Moreno","year":"2021","unstructured":"Estrada-Moreno, A., Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the ($$k, t$$)-metric dimension of graphs. Comput. J. 64(5), 707\u2013720 (2021)","journal-title":"Comput. J."},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.disc.2005.09.015","volume":"306","author":"M Fehr","year":"2006","unstructured":"Fehr, M., Gosselin, S., Oellermann, O.R.: The metric dimension of Cayley digraphs. Discrete Math. 306, 31\u201341 (2006)","journal-title":"Discrete Math."},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2017.11.019","volume":"236","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results. Discrete Appl. Math. 236, 183\u2013202 (2018)","journal-title":"Discrete Appl. Math."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Frongillo, R.M., Geneson, J., Lladser, M.E., Tillquist, R.C., Yi, E.: Truncated metric dimension for finite graphs (2021, Submitted)","DOI":"10.1016\/j.dam.2022.04.021"},{"key":"44_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"44_CR13","unstructured":"Geneson, J., Yi, E.: Broadcast dimension of graphs. arXiv:2005.07311v1 (2020). https:\/\/arxiv.org\/abs\/2005.07311"},{"key":"44_CR14","unstructured":"Geneson, J., Yi, E.: The distance-$$k$$ dimension of graphs. arXiv:2106.08303v2 (2021). https:\/\/arxiv.org\/abs\/2106.08303"},{"key":"44_CR15","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Hernando, C., Mora, M., Pelayo, I.M., Seara, C., Wood, D.R.: Extremal graph theory for metric dimension and diameter. Electron. J. Combin. 17, 1\u201328 (2010). Article no. R30","DOI":"10.37236\/302"},{"issue":"22","key":"44_CR17","doi-asserted-by":"publisher","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","volume":"312","author":"M Jannesari","year":"2012","unstructured":"Jannesari, M., Omoomi, B.: The metric dimension of the lexicographic product of graphs. Discrete Math. 312(22), 3349\u20133356 (2012)","journal-title":"Discrete Math."},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.dam.2016.05.027","volume":"213","author":"CX Kang","year":"2016","unstructured":"Kang, C.X.: On the fractional strong metric dimension of graphs. Discrete Appl. Math. 213, 153\u2013161 (2016)","journal-title":"Discrete Appl. Math."},{"key":"44_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-03780-6_8","volume-title":"Combinatorial Optimization and Applications","author":"CX Kang","year":"2013","unstructured":"Kang, C.X., Yi, E.: The fractional strong metric dimension of graphs. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 84\u201395. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03780-6_8"},{"key":"44_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. Discrete Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"44_CR21","first-page":"17","volume":"40","author":"C Poisson","year":"2002","unstructured":"Poisson, C., Zhang, P.: The metric dimension of unicyclic graphs. J. Combin. Math. Combin. Comput. 40, 17\u201332 (2002)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"44_CR22","volume-title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","author":"ER Scheinerman","year":"1997","unstructured":"Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley, New York (1997)"},{"key":"44_CR23","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congr. Numer. 14, 549\u2013559 (1975)","journal-title":"Congr. Numer."},{"key":"44_CR24","unstructured":"Tillquist, R.C.: Low-dimensional embeddings for symbolic data science. Dissertation, University of Colorado, Boulder (2020)"},{"key":"44_CR25","unstructured":"Tillquist, R.C., Frongillo, R.M., Lladser, M.E.: Truncated metric dimension for finite graphs. arXiv:2106.14314v1 (2021). https:\/\/arxiv.org\/abs\/2106.14314"},{"key":"44_CR26","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10114-015-4160-5","volume":"31","author":"E Yi","year":"2015","unstructured":"Yi, E.: The fractional metric dimension of permutation graphs. Acta Math. Sin. Engl. Ser. 31, 367\u2013382 (2015)","journal-title":"Acta Math. Sin. Engl. Ser."},{"key":"44_CR27","unstructured":"Yi, E.: The fractional $$k$$-truncated metric dimension of graphs. arXiv:2108.02745v1 (2021). https:\/\/arxiv.org\/abs\/2108.02745"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T22:23:40Z","timestamp":1673994220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}