2023
DOI: 10.1016/j.asoc.2023.110493
|View full text |Cite
|
Sign up to set email alerts
|

A centrality based genetic algorithm for the graph burning problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…That approach creates the algorithms by applying some selections and mutation operations. It can handle numerous scheduling problems and requirements [2]. The roulette wheel selection is frequently employed method for choosing chromosomes in genetic algorithms.…”
Section: B Genetic Algorithmsmentioning
confidence: 99%
“…That approach creates the algorithms by applying some selections and mutation operations. It can handle numerous scheduling problems and requirements [2]. The roulette wheel selection is frequently employed method for choosing chromosomes in genetic algorithms.…”
Section: B Genetic Algorithmsmentioning
confidence: 99%