A centrality based genetic algorithm for the graph burning problem
Abstract Information spread is an intriguing topic to study in network science, which
investigates how information, influence, or contagion propagate through networks. Graph …
investigates how information, influence, or contagion propagate through networks. Graph …
Random walks-based node centralities to attack complex networks
Investigating the network response to node removal and the efficacy of the node removal
strategies is fundamental to network science. Different research studies have proposed …
strategies is fundamental to network science. Different research studies have proposed …
A greedy heuristic for graph burning
J García-Díaz, JA Cornejo-Acosta… - arXiv preprint arXiv …, 2024 - arxiv.org
Given a graph $ G $, the optimization version of the graph burning problem seeks for a
sequence of vertices, $(u_1, u_2,..., u_p)\in V (G)^ p $, with minimum $ p $ and such that …
sequence of vertices, $(u_1, u_2,..., u_p)\in V (G)^ p $, with minimum $ p $ and such that …
A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs
We propose an exact algorithm for the Graph Burning Problem (GBP), an NP-hard
optimization problem that models the spread of influence on social networks. Given a graph …
optimization problem that models the spread of influence on social networks. Given a graph …
Graph-Clustering Method for Construction of the Optimal Movement Trajectory under the Terrain Patrolling
BV Rumiantsev, RA Kochkarov, AA Kochkarov - Mathematics, 2023 - mdpi.com
The method of the optimal movement trajectory construction in the terrain patrolling tasks is
proposed. The method is based on the search of the Hamiltonian circuit on the graph of the …
proposed. The method is based on the search of the Hamiltonian circuit on the graph of the …
The Moving Firefighter Problem
BR Gutiérrez-De-La-Paz, J García-Díaz… - Mathematics, 2022 - mdpi.com
The original formulation of the firefighter problem defines a discrete-time process where a
fire starts at a designated subset of the vertices of a graph G. At each subsequent discrete …
fire starts at a designated subset of the vertices of a graph G. At each subsequent discrete …
Solving the Graph Burning Problem for Large Graphs
We propose an exact algorithm for the Graph Burning Problem ($\texttt {GBP} $), an NP-hard
optimization problem that models the spread of influence on social networks. Given a graph …
optimization problem that models the spread of influence on social networks. Given a graph …
[PDF][PDF] A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs
F de Carvalho Pereira, PJ de Rezende, T Yunes… - thyunes.github.io
We propose an exact algorithm for the Graph Burning Problem (GBP), an NP-hard
optimization problem that models the spread of influence on social networks. Given a graph …
optimization problem that models the spread of influence on social networks. Given a graph …
[PDF][PDF] The Graph Burning Problem under Constrained Diffusion
E Iurlano, GR Raidl, M Djukanović - ac.tuwien.ac.at
Relying on a simplified model of fire spread, the Graph Burning Problem is an NP-hard
combinatorial optimization problem that yields a social contagion metric. It concerns a …
combinatorial optimization problem that yields a social contagion metric. It concerns a …
ИНФОРМАЦИОННО-ИЗМЕРИТЕЛЬНЫЕ И УПРАВЛЯЮЩИЕ СИСТЕМЫ
БВ РУМЯНЦЕВ, АА КОЧКАРОВ - … И УПРАВЛЯЮЩИЕ СИСТЕМЫ …, 2022 - elibrary.ru
Постановка проблемы. В настоящее время в связи с внедрением автоматизированных
средств передвижения актуальной становится задача построения оптимальной …
средств передвижения актуальной становится задача построения оптимальной …