{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:39:32Z","timestamp":1773981572990,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030648428","type":"print"},{"value":"9783030648435","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_39","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"577-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fractional Maker-Breaker Resolving Game"],"prefix":"10.1007","author":[{"given":"Eunjeong","family":"Yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"39_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. Discret. Math. 312, 1584\u20131590 (2012)","journal-title":"Discret. Math."},{"key":"39_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":"39_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735202","volume-title":"Combinatorial Games: Tic-Tac-Toe Theory","author":"J Beck","year":"2008","unstructured":"Beck, J.: Combinatorial Games: Tic-Tac-Toe Theory. Cambridge University Press, Cambridge (2008)"},{"key":"39_CR4","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, 2168\u20132181 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/100786800","volume":"24","author":"B Bre\u0161ar","year":"2010","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: Domination game and an imagination strategy. SIAM J. Discret. Math. 24, 979\u2013991 (2010)","journal-title":"SIAM J. Discret. Math."},{"key":"39_CR6","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. Comb. Math. Comb. Comput. 39, 157\u2013167 (2001)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Duch\u00eane, E., Gledel, V., Parreau, A., Renault, G.: Maker-Breaker domination game. Discret. Math. 343(9) (2020). #111955","DOI":"10.1016\/j.disc.2020.111955"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","volume":"14","author":"P Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Selfridge, J.L.: On a combinatorial game. J. Comb. Theory Ser. A 14, 298\u2013301 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"key":"39_CR9","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":"39_CR10","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Comb. 2, 191\u2013195 (1976)","journal-title":"Ars Comb."},{"key":"39_CR11","series-title":"Oberwolfach Seminars","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-0348-0825-5_9","volume-title":"Positional Games","author":"D Hefetz","year":"2014","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: The neighborhood conjecture. Positional Games. OS, vol. 44, pp. 113\u2013139. Springer, Basel (2014). https:\/\/doi.org\/10.1007\/978-3-0348-0825-5_9"},{"key":"39_CR12","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. Comb. (2010). #R30","DOI":"10.37236\/302"},{"key":"39_CR13","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. Discret. Appl. Math. 213, 153\u2013161 (2016)","journal-title":"Discret. Appl. Math."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Kang, C.X., Klav\u017ear, S., Yero, I.G., Yi, E.: Maker-Breaker resolving game. arXiv:2005.13242 (2020)","DOI":"10.1007\/s40840-020-01044-0"},{"key":"39_CR15","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":"39_CR16","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":"39_CR17","first-page":"302","volume":"5","author":"DJ Klein","year":"2012","unstructured":"Klein, D.J., Yi, E.: A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs. Eur. J. Pure Appl. Math. 5(3), 302\u2013316 (2012)","journal-title":"Eur. J. Pure Appl. Math."},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakawski","year":"1983","unstructured":"Nowakawski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discret. Math. 43, 235\u2013239 (1983)","journal-title":"Discret. Math."},{"key":"39_CR19","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, 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"39_CR20","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":"39_CR21","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). https:\/\/doi.org\/10.1007\/s10114-015-4160-5","journal-title":"Acta Math. Sin. Engl. Ser."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T17:09:40Z","timestamp":1607101780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","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":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}