A Population-Based Local Search Algorithm for the Identifying Code Problem

The identifying code problem for a given graph involves finding a minimum subset of vertices such that each vertex of the graph is uniquely specified by its nonempty neighborhood within the identifying code. The combinatorial optimization problem has a wide variety of applications in location and de...

Full description

Bibliographic Details
Published in:Mathematics
Main Authors: Alejandro Lara-Caballero, Diego González-Moreno
Format: Article
Language:English
Published: MDPI AG 2023-10-01
Subjects:
identifying code
combinatorial optimization
population-based search
local search
configuration checking
Online Access:https://www.mdpi.com/2227-7390/11/20/4361

Internet

https://www.mdpi.com/2227-7390/11/20/4361

Similar Items