Heuristics for Spreading Alarm throughout a Network
暂无分享,去创建一个
Ladislav Huraj | Marek Šimon | Iveta Dirgová Luptáková | Jiří Pospíchal | L. Huraj | Iveta Dirgová Luptáková | Jiri Pospíchal | M. Šimon
[1] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[2] Anthony Bonato,et al. Burning a graph is hard , 2015, Discret. Appl. Math..
[3] Jean M. Vettel,et al. Applications of community detection techniques to brain graphs: Algorithmic considerations and implications for neural function , 2017, bioRxiv.
[4] Claude Duvallet,et al. Cluster‐based emergency message dissemination strategy for VANET using V2V communication , 2019, Int. J. Commun. Syst..
[5] Dieter Mitsche,et al. Burning Graphs: A Probabilistic Perspective , 2017, Graphs Comb..
[6] Rakesh Nagi,et al. Seed activation scheduling for influence maximization in social networks , 2017, Omega.
[7] Anthony Bonato,et al. Bounds on the burning number , 2018, Discret. Appl. Math..
[8] Dieter Mitsche,et al. Burning number of graph products , 2018, Theor. Comput. Sci..
[9] Gary MacGillivray,et al. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 43 (2009), Pages 57–77 The Firefighter Problem: A survey of results, directions and questions , 2022 .
[10] Ladislav Huraj,et al. Multi-Hub Location Heuristic for Alert Routing , 2019, IEEE Access.
[11] Kok Bin Wong,et al. On the Burning Number of Generalized Petersen Graphs , 2018 .
[12] J. Sanchez,et al. Local Search Algorithms for the Vertex K-Center Problem , 2018 .
[13] M. Hosťovecký,et al. Brain activity: beta wave analysis of 2D and 3D serious games using EEG , 2017 .
[14] My T. Thai,et al. Competitive Influence Maximization within Time and Budget Constraints in Online Social Networks: An Algorithmic Approach , 2019 .
[15] Anthony Bonato,et al. How to Burn a Graph , 2015, Internet Math..
[16] Huiqing Liu,et al. Burning number of theta graphs , 2019, Appl. Math. Comput..
[17] Trong-The Nguyen,et al. A Compact Bat Algorithm for Unequal Clustering in Wireless Sensor Networks , 2019, Applied Sciences.
[18] Y. Li,et al. Greedy algorithms for packing unequal circles into a rectangular container , 2005, J. Oper. Res. Soc..