نوع مقاله : مقاله پژوهشی
نویسندگان
1 گروه ریاضی- دانشکده علوم پایه ـ دانشگاه ولایت - ایرانشهرـ ایران
2 گروه ریاضی کاربردی دانشکده علوم ریاضی دانشگاه فردوسی مشهد
چکیده
کلیدواژهها
موضوعات
عنوان مقاله [English]
نویسندگان [English]
In this paper, a Tabu Search-based algorithm is proposed to find the l-clique metric generator set in connected graphs. The algorithm aims to minimize the size of a set of vertices that can uniquely identify the l-cliques in the graph. This problem, as a generalization of the classical metric dimension, is NP-hard and requires heuristic optimization methods due to its computational complexity. The proposed algorithm uses a tabu list and generates neighboring sets to search for an optimal solution, and through an evaluation function, it minimizes the number of vertices with identical metric codes. The results demonstrate that this approach is highly effective in identifying group structures in complex networks, with potential applications in network analysis and data mining.
کلیدواژهها [English]
)