Abstract
Let G be a simple graph, where each vertex has a nonnegative weight. A vertex subset S of G is a doubly resolving set (DRS) of G if for every pair of vertices u, v in G, there exist \(x,y\in S\) such that \(d(x,u)-d(x,v)\ne d(y,u)-d(y,v)\). The minimum weighted doubly resolving set (MWDRS) problem is finding a doubly resolving set with minimum total weight. We establish a linear time algorithm for the MWDRS problem of all graphs in which each block is complete graph or cycle. Hence, the MWDRS problems for block graphs and cactus graphs can be solved in linear time. We also prove that k-edge-augmented tree (a tree with additional k edges) with minimum degree \(\delta (G)\ge 2\) admits a doubly resolving set of size at most \(2k+1\). This implies that the DRS problem on k-edge-augmented tree can be solved in \(O(n^{2k+3})\) time.
Supported in part by National Natural Science Foundation of China (Nos. 11371008, 11871222) and Science and Technology Commission of Shanghai Municipality (No. 18dz2271000).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bailey, R.F., Cameron, P.J.: Base size, metric dimension and other invariants of groups and graphs. Bull. Lond. Math. Soc. 43(2), 209–242 (2011)
Cáceres, J., et al.: On the metric dimension of Cartesian products of graphs. SIAM J. Discrete Math. 21(2), 423–441 (2007)
Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105(1–3), 99–113 (2000)
Chen, L., Lu, C., Zeng, Z.: Labelling algorithms for paired-domination problems in block and interval graphs. J. Comb. Optim. 19(4), 457–470 (2010)
Chen, X., Wang, C.: Approximability of the minimum weighted doubly resolving set problem. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 357–368. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08783-2_31
Díaz, 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–430. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_37
Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4), 1130–1171 (2015)
Gomez-Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. ACM Trans. Knowl. Discov. Data (TKDD) 5(4), 21 (2012)
Harary, F., Melter, R.: On the metric dimension of a graph. Ars Comb. 2(191–195), 1 (1976)
Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70(3), 217–229 (1996)
Kratica, J., Čangalović, M., Kovačević-Vujčić, V.: Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36(7), 2149–2159 (2009)
Kratica, J., Kovačević-Vujčić, V., Čangalović, M., Stojanović, M.: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs. Appl. Anal. Discrete Math. 6(1), 63–71 (2012)
Kratica, J., Kovačević-Vujčić, V., Čangalović, M., Stojanović, M.: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl. Math. Comput. 218(19), 9790–9801 (2012)
Pinto, P.C., Thiran, P., Vetterli, M.: Locating the source of diffusion in large-scale networks. Phys. Rev. Lett. 109(6), 068702 (2012)
Shah, D., Zaman, T.: Rumors in a network: who’s the culprit? IEEE Trans. Inform. Theory 57(8), 5163–5181 (2011)
Slater, P.J.: Leaves of trees. Congr. Numer. 14(549–559), 37 (1975)
Čangalović, M., Kratica, J., Kovačević-Vujčić, V., Stojanović, M.: Minimal doubly resolving sets of prism graphs. Optimization 62(8), 1037–1043 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Lu, C., Ye, Q., Zhu, C. (2019). Algorithmic Aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-27195-4_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27194-7
Online ISBN: 978-3-030-27195-4
eBook Packages: Computer ScienceComputer Science (R0)