.png){kind=icon}
返回
A centrality based genetic algorithm for the graph burning problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2023.110493.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Information spread is an intriguing topic to study in network science, which investigates how information, influence, or contagion propagate through networks. Graph burning is a simplified deterministic model for how information spreads within networks. The complicated NP-complete nature of the problem makes it computationally difficult to solve using exact algorithms. Accordingly, a number of heuristics and approximation algorithms have been proposed in the literature for the graph burning problem. In this paper, we propose an efficient genetic algorithm called Centrality BAsed Geneticalgorithm (CBAG) for solving the graph burning problem. Considering the unique characteristics of the graph burning problem, we introduce novel genetic operators, chromosome representation, and evaluation method. In the proposed algorithm, the well-known betweenness centrality is used as the backbone of our chromosome initialization procedure. The proposed algorithm is implemented and compared with previous heuristics and approximation algorithms on 15 benchmark graphs of different sizes. Based on the results, it can be seen that the proposed algorithm achieves better performance in comparison to the previous state-of-the-art heuristics. The complete source code is available online and can be used to find optimal or near-optimal solutions for the graph burning problem. & COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Graph burning
Genetic algorithm
Burning number
Centrality
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏An Epidemiological Study of Non-specific Low Back Pain in Non-professional Female Greek Classic Ballet Dancers.png)
Folia Medica
OAAI
Folia MedicaIF0
OAAI分享收藏
查看更多内容