Bibliography

1

John S Baras and Pedram Hovareshti. Efficient and robust communication topologies for distributed decision making in networked systems. In Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 3751–3756. IEEE, 2009.

2

Alina Beygelzimer, Geoffrey Grinstein, Ralph Linsker, and Irina Rish. Improving network robustness by edge modification. Physica A: Statistical Mechanics and its Applications, 357(3-4):593–612, 2005.

3

Hau Chan and Leman Akoglu. Optimizing network robustness by edge rewiring: a general framework. Data Mining and Knowledge Discovery, 30(5):1395–1425, 2016.

4

Hau Chan, Leman Akoglu, and Hanghang Tong. Make it or break it: manipulating robustness in large networks. In Proceedings of the 2014 SIAM International Conference on Data Mining, 325–333. SIAM, 2014.

5

Chen Chen, Hanghang Tong, B Aditya Prakash, Charalampos E Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, and Duen Horng Chau. Node immunization on large graphs: theory and algorithms. IEEE Transactions on Knowledge and Data Engineering, 28(1):113–126, 2015.

6

Wendy Ellens and Robert E Kooij. Graph measures and network robustness. arXiv preprint arXiv:1311.5064, 2013.

7

Wendy Ellens, FM Spieksma, P Van Mieghem, A Jamakovic, and RE Kooij. Effective graph resistance. Linear algebra and its applications, 435(10):2491–2506, 2011.

8

Abdol–Hossein Esfahanian. Connectivity algorithms. In Topics in structural graph theory, pages 268–281. Cambridge University Press, 2013.

9

Ernesto Estrada. Network robustness to targeted attacks. the interplay of expansibility and degree distribution. The European Physical Journal B-Condensed Matter and Complex Systems, 52(4):563–574, 2006.

10

Ernesto Estrada and Juan A Rodríguez-Velázquez. Spectral measures of bipartivity in complex networks. Physical Review E, 72(4):046105, 2005.

11

Miroslav Fiedler. Algebraic connectivity of graphs. Czechoslovak mathematical journal, 23(2):298–305, 1973.

12

Arpita Ghosh, Stephen Boyd, and Amin Saberi. Minimizing effective resistance of a graph. SIAM review, 50(1):37–66, 2008.

13

Petter Holme, Beom Jun Kim, Chang No Yoon, and Seung Kee Han. Attack vulnerability of complex networks. Physical review E, 65(5):056109, 2002.

14

Fragkiskos D Malliaros, Vasileios Megalooikonomou, and Christos Faloutsos. Fast robustness estimation in large social graphs: communities and anomaly detection. In Proceedings of the 2012 SIAM International Conference on Data Mining, 942–953. SIAM, 2012.

15

Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: bringing order to the web. Technical Report, Stanford InfoLab, 1999.

16

Hanghang Tong, B Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, and Christos Faloutsos. Gelling, and melting, large graphs by edge manipulation. In Proceedings of the 21st ACM international conference on Information and knowledge management, 245–254. 2012.

17

Hanghang Tong, B Aditya Prakash, Charalampos Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, and Duen Horng Chau. On the vulnerability of large graphs. In 2010 IEEE International Conference on Data Mining, 1091–1096. IEEE, 2010.