Heuristics for Spreading Alarm throughout a Network
This paper provides heuristic methods for obtaining a burning number, which is a graph parameter measuring the speed of the spread of alarm, information, or contagion. For discrete time steps, the heuristics determine which nodes (centers, hubs, vertices, users) should be alarmed (in other words, bu...
Main Authors: | Marek Šimon, Ladislav Huraj, Iveta Dirgová Luptáková, Jiří Pospíchal |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-08-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/9/16/3269 |
Similar Items
-
How to Burn a Network or Spread Alarm
by: Marek Simon, et al.
Published: (2019-12-01) -
Multi-Hub Location Heuristic for Alert Routing
by: Marek Simon, et al.
Published: (2019-01-01) -
Combined Heuristic Attack Strategy on Complex Networks
by: Marek Šimon, et al.
Published: (2017-01-01) -
Neural Gas Clustering Adapted for Given Size of Clusters
by: Iveta Dirgová Luptáková, et al.
Published: (2016-01-01) -
A Contribution to Sonograph Image Quality Estimation Using Point Spread Function
by: Ladislav Doležal, et al.
Published: (2004-01-01)