Basma Mohamed1,*, Linda Mohaisen2, Mohamed Amin1
Intelligent Automation & Soft Computing, Vol.36, No.2, pp. 2349-2361, 2023, DOI:10.32604/iasc.2023.032930
Abstract In this paper, we consider the NP-hard problem of finding the minimum connected resolving set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B. A resolving set B of G is connected if the subgraph induced by B is a nontrivial connected subgraph of G. The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G. The problem is solved heuristically… More >
Login
Register
