Abstract
Networks are very important in the world. In signal processing, the towers are modeled as nodes (vertices) and if two towers communicate, then they have an arc (edge) between them or precisely, they are adjacent. The least number of nodes in a network that can uniquely locate every node in the network is known in the network theory as the resolving set of a network. One of the properties that is used in determining the resolving set is the distance between the nodes. Two nodes are at a distance one if there is a single arc can link them whereas the distance between any two random nodes in the network is the least number of distinct arcs that can link them. We propose two algorithms in this paper with the proofs of correctness. The first one is in lines with the BFS that find distance between a designated node to every other node in the network. This algorithm runs in O(log n). The second algorithm is to identify the integer k, such that the given graph is k-metric dimensional. This can be implemented in O(log n) time with O(n2) processors in a CRCW PRAM.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal’ak, M., Ram, L.S.: Network Discovery and Verification. IEEE J. Sel. Areas Commun. 24(12), 2168–2181 (2006)
Caceres, J, Hernando, C., Mora, M., Pelayo, I. M., Puertas, M. L. , Seara, C., Wood, D.R.: On the metric dimension of cartesian product 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 Applied Mathematics 105(1–3), 99–113 (2000)
Chartrand, G., Poisson, C., Zhang, P.: Resolvability and the upper dimension of graphs. Computters Mathematics with Applications 39(12), 19–28 (2000)
Chelladurai, X., Iyengar, S.S.: Introduction to Parallel Algorithms, John Wiley & Sons (1998)
Chelladurai, X., Kureethara, J.V.: Algorithms for the Metric Dimension of a Simple Graph. Data Science and Security, Lecture Notes in Networks and Systems, Springer 132, 91–105 (2020)
Diaz, J., Pottonen, O., Serna, M., Van Leeuwen, E.J.: Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83(1), 132–158 (2017)
Estrada-Moreno, A., Rodr ́ıguez-Vela ́zquez, J.A., Yero, I.G.: k-metric Dimension of Graphs, arXiv:1312.6840 [math.CO] (2013)
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 International Workshop on Graph-Theoretic Concepts in Computer Science (pp. 456–471). Springer, Berlin, Heidelberg (2015)
Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combinatoria 2, 191–195 (1976)
Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Applied Mathe- matics 70, 217–229 (1996)
Kuziak, D., Yero, I.G., Rodr ́ıguez-Vel ́azquez, I. J.: On the strong metric dimension of corona product graphs and join graphs, Discrete Applied Mathematics 161 (7–8), 1022–1027 (2013)
Muhammad, F., Susilowati, L.: Algorithm and computer program to determine metric dimension of graph. In Journal of Physics: Conference Series, 1494(012018) (2020)
Okamoto, F., Phinezy, B., Zhang, P.: The local metric dimension of a graph. Mathematica Bohemica 135(3), 239–255 (2010)
Sebo, Ä., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29(2), 383–393 (2004)
Slater, P.J.: Leaves of trees. Congressus Numerantium 14, 549–559 (1975)
Yero, I. G. , Kuziak, D., Rodr ́ıquez-Vel ́azquez, J. A.: On the metric dimension of corona product graphs, Comput. Math. Appl. 61(9) (2011) 2793–2798 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Chelladurai, X., Kureethara, J.V. (2021). Parallel Algorithm to find Integer k where a given Well-Distributed Graph is k-Metric Dimensional. In: Bhattacharyya, S., Mršić, L., Brkljačić, M., Kureethara, J.V., Koeppen, M. (eds) Recent Trends in Signal and Image Processing. ISSIP 2020. Advances in Intelligent Systems and Computing, vol 1333. Springer, Singapore. https://doi.org/10.1007/978-981-33-6966-5_15
Download citation
DOI: https://doi.org/10.1007/978-981-33-6966-5_15
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-33-6965-8
Online ISBN: 978-981-33-6966-5
eBook Packages: EngineeringEngineering (R0)