Improving network robustness
暂无分享,去创建一个
[1] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[2] Doyle,et al. Highly optimized tolerance: robustness and design in complex systems , 2000, Physical review letters.
[3] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[4] Jan van Leeuwen,et al. Diameter increase caused by edge deletion , 1987, J. Graph Theory.
[5] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .
[6] B. Bollobás. The evolution of random graphs , 1984 .
[7] Hiroki Sayama,et al. Optimization of robustness and connectivity in complex networks. , 2003, Physical review letters.
[8] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[9] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[10] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[11] Peter Eades,et al. A Heuristics for Graph Drawing , 1984 .
[12] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.
[13] Bernd Meyer,et al. Self-Organizing Graphs - A Neural Network Perspective of Graph Layout , 1998, GD.
[14] Bojan Mohar,et al. Laplace eigenvalues of graphs - a survey , 1992, Discret. Math..
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Kai-Yeung Siu,et al. Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[17] Christos Gkantsidis,et al. Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.
[18] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..
[19] Sugih Jamin,et al. Inet-3.0: Internet Topology Generator , 2002 .
[20] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[21] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[22] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[23] A. Vespignani,et al. The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[24] R. Linsker,et al. Improving network robustness by edge modification , 2005 .