{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:31:53Z","timestamp":1777433513828,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871222"],"award-info":[{"award-number":["11871222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371008"],"award-info":[{"award-number":["11371008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["18dz2271000"],"award-info":[{"award-number":["18dz2271000"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00575-3","type":"journal-article","created":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T05:03:03Z","timestamp":1587790983000},"page":"2029-2039","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Changhong","family":"Lu","sequence":"first","affiliation":[]},{"given":"Qingjie","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Chengru","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,25]]},"reference":[{"issue":"2","key":"575_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1112\/blms\/bdq096","volume":"43","author":"RF Bailey","year":"2011","unstructured":"Bailey RF, Cameron PJ (2011) Base size, metric dimension and other invariants of groups and graphs. Bull Lond Math Soc 43(2):209\u2013242","journal-title":"Bull Lond Math Soc"},{"issue":"2","key":"575_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres J, Hernando C, Mora M, Pelayo IM, MaL Puertas, Seara C, Wood DR (2007) On the metric dimension of Cartesian products of graphs. SIAM J Discrete Math 21(2):423\u2013441","journal-title":"SIAM J Discrete Math"},{"issue":"8","key":"575_CR3","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1080\/02331934.2013.772999","volume":"62","author":"M \u010cangalovi\u0107","year":"2013","unstructured":"\u010cangalovi\u0107 M, Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, Stojanovi\u0107 M (2013) Minimal doubly resolving sets of prism graphs. Optimization 62(8):1037\u20131043","journal-title":"Optimization"},{"issue":"1\u20133","key":"575_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 MA, Oellermann OR (2000) Resolvability in graphs and the metric dimension of a graph. Discrete Appl Math 105(1\u20133):99\u2013113","journal-title":"Discrete Appl Math"},{"key":"575_CR5","doi-asserted-by":"crossref","unstructured":"Chen X, Wang C (2014) Approximability of the minimum weighted doubly resolving set problem. In: Computing and combinatorics. Lecture notes in computer science, vol\u00a08591. Springer, Cham, pp 357\u2013368","DOI":"10.1007\/978-3-319-08783-2_31"},{"issue":"4","key":"575_CR6","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10878-008-9177-6","volume":"19","author":"L Chen","year":"2010","unstructured":"Chen L, Lu C, Zeng Z (2010) Labelling algorithms for paired-domination problems in block and interval graphs. J Comb Optim 19(4):457\u2013470","journal-title":"J Comb Optim"},{"key":"575_CR7","doi-asserted-by":"crossref","unstructured":"D\u00edaz J, Pottonen O, Serna M, van Leeuwen EJ (2012) On the complexity of metric dimension. In: Algorithms\u2014ESA 2012. Lecture notes in computer science, vol\u00a07501. Springer, Heidelberg, pp 419\u2013430","DOI":"10.1007\/978-3-642-33090-2_37"},{"issue":"4","key":"575_CR8","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 GJ (2015) The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4):1130\u20131171","journal-title":"Algorithmica"},{"issue":"4","key":"575_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2086737.2086741","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. ACM Trans Knowl Discov Data 5(4):21","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"191\u2013195","key":"575_CR10","first-page":"1","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary F, Melter R (1976) On the metric dimension of a graph. Ars Comb 2(191\u2013195):1","journal-title":"Ars Comb"},{"issue":"3","key":"575_CR11","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 (1996) Landmarks in graphs. Discrete Appl Math 70(3):217\u2013229","journal-title":"Discrete Appl Math"},{"issue":"7","key":"575_CR12","doi-asserted-by":"publisher","first-page":"2149","DOI":"10.1016\/j.cor.2008.08.002","volume":"36","author":"J Kratica","year":"2009","unstructured":"Kratica J, \u010cangalovi\u0107 M, Kova\u010devi\u0107-Vuj\u010di\u0107 V (2009) Computing minimal doubly resolving sets of graphs. Comput Oper Res 36(7):2149\u20132159","journal-title":"Comput Oper Res"},{"issue":"1","key":"575_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.2298\/AADM111116023K","volume":"6","author":"J Kratica","year":"2012","unstructured":"Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M, Stojanovi\u0107 M (2012a) Minimal doubly resolving sets and the strong metric dimension of Hamming graphs. Appl Anal Discrete Math 6(1):63\u201371","journal-title":"Appl Anal Discrete Math"},{"issue":"19","key":"575_CR14","first-page":"9790","volume":"218","author":"J Kratica","year":"2012","unstructured":"Kratica J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M, Stojanovi\u0107 M (2012b) Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl Math Comput 218(19):9790\u20139801","journal-title":"Appl Math Comput"},{"issue":"6","key":"575_CR15","doi-asserted-by":"publisher","first-page":"068702","DOI":"10.1103\/PhysRevLett.109.068702","volume":"109","author":"PC Pinto","year":"2012","unstructured":"Pinto PC, Thiran P, Vetterli M (2012) Locating the source of diffusion in large-scale networks. Phys Rev Lett 109(6):068702","journal-title":"Phys Rev Lett"},{"issue":"8","key":"575_CR16","doi-asserted-by":"publisher","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","volume":"57","author":"D Shah","year":"2011","unstructured":"Shah D, Zaman T (2011) Rumors in a network: who\u2019s the culprit? IEEE Trans Inf Theory 57(8):5163\u20135181","journal-title":"IEEE Trans Inf Theory"},{"issue":"549\u2013559","key":"575_CR17","first-page":"37","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater PJ (1975) Leaves of trees. Congr Numer 14(549\u2013559):37","journal-title":"Congr Numer"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00575-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00575-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00575-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:47:49Z","timestamp":1664354869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00575-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,25]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["575"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00575-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,25]]},"assertion":[{"value":"25 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}