Analysis of diversity in an evolutionary algorithm for the graph burning problem

The graph burning problem helps quantify how vulnerable a graph is to contagion (it simulates an infection spread). This study performs an analysis of diversity of an evolutionary algorithm and proposes a metric distance to measure diversity.

Pregunta al documento

Inicia sesión para preguntarle al documento.