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.
Sabeghi,N and Tavakoli,M . (2025). A Tabu Search-Based Approach for Finding the Optimal l-Clique Metric Generator Set in Graphs. (e115167). Soft Computing Journal, (), e115167 doi: 10.22052/scj.2025.255776.1283
MLA
Sabeghi,N , and Tavakoli,M . "A Tabu Search-Based Approach for Finding the Optimal l-Clique Metric Generator Set in Graphs" .e115167 , Soft Computing Journal, , , 2025, e115167. doi: 10.22052/scj.2025.255776.1283
HARVARD
Sabeghi N, Tavakoli M. (2025). 'A Tabu Search-Based Approach for Finding the Optimal l-Clique Metric Generator Set in Graphs', Soft Computing Journal, (), e115167. doi: 10.22052/scj.2025.255776.1283
CHICAGO
N Sabeghi and M Tavakoli, "A Tabu Search-Based Approach for Finding the Optimal l-Clique Metric Generator Set in Graphs," Soft Computing Journal, (2025): e115167, doi: 10.22052/scj.2025.255776.1283
VANCOUVER
Sabeghi N, Tavakoli M. A Tabu Search-Based Approach for Finding the Optimal l-Clique Metric Generator Set in Graphs. SCJ. 2025;():e115167 (In Persian). doi: 10.22052/scj.2025.255776.1283
