From post

The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis.

, , и . WAW, том 13894 из Lecture Notes in Computer Science, стр. 99-111. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Scale-free networks need not be fragile., , и . ASONAM, стр. 332-339. IEEE, (2020)Robustness of Preferential-Attachment Graphs: Shifting the Baseline., и . COMPLEX NETWORKS (2), том 1078 из Studies in Computational Intelligence, стр. 445-456. Springer, (2022)The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis., , и . WAW, том 13894 из Lecture Notes in Computer Science, стр. 99-111. Springer, (2023)Constructing Provably Robust Scale-Free Networks., и . NetSci-X, том 13197 из Lecture Notes in Computer Science, стр. 126-139. Springer, (2022)A Low-Cost Sparse Recovery Framework for Weighted Networks under Compressive Sensing., , , , , и . SmartCity, стр. 183-190. IEEE Computer Society, (2015)Robustness of preferential-attachment graphs., и . Appl. Netw. Sci., 8 (1): 32 (декабря 2023)A Compressive Sensing Framework for Distributed Detection of High Closeness Centrality Nodes in Networks., , , , и . COMPLEX NETWORKS (2), том 813 из Studies in Computational Intelligence, стр. 91-103. Springer, (2018)Compressive closeness in networks., , и . Appl. Netw. Sci., 4 (1): 100:1-100:21 (2019)