A greedy heuristic for graph burning.
Jesús García-DíazJosé Alejandro Cornejo-AcostaPublished in: CoRR (2024)
Keyphrases
- greedy heuristic
- minimum weight
- greedy algorithm
- np hard
- knapsack problem
- weighted graph
- graph theory
- graph representation
- worst case analysis
- directed graph
- graph matching
- random walk
- optimal solution
- graph model
- set cover
- structured data
- lower bound
- stable set
- graphical representation
- data sets
- graph partitioning
- graph databases
- numerical simulations
- connected components
- special case
- genetic algorithm
- machine learning