A linear time algorithm for metric dimension of cactus block graphs.
Theor. Comput. Sci.(2016)
摘要
An undirected graph G = ( V , E ) has metric dimension at most k if there is a vertex set U ¿ V such that | U | ¿ k and ¿ u , v ¿ V , u ¿ v , there is a vertex w ¿ U such that d G ( w , u ) ¿ d G ( w , v ) , where d G ( u , v ) is the distance (the length of a shortest path in an unweighted graph) between u and v. The metric dimension of G is the smallest integer k such that G has metric dimension at most k. A cactus block graph is an undirected graph whose biconnected components are either cycles or complete graphs. We present a linear time algorithm for computing the metric dimension of cactus block graphs.
更多查看译文
关键词
Linear time algorithm,Metric dimension,Cactus block graphs,Resolving set
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络