Complexity of the critical node problem over trees
暂无分享,去创建一个
[1] Lily Elefteriadou. HIGHWAY CAPACITY. IN: HANDBOOK OF TRANSPORTATION ENGINEERING , 2004 .
[2] Kenneth H. Rosen,et al. Discrete Mathematics and its applications , 2000 .
[3] Valdis E. Krebs,et al. Uncloaking Terrorist Networks , 2002, First Monday.
[4] Stephen P. Borgatti. Identifying sets of key players in a network , 2003, IEMC '03 Proceedings. Managing Technologically Driven Organizations: The Human Side of Innovation and Change (IEEE Cat. No.03CH37502).
[5] Zhou Tao,et al. Epidemic dynamics on complex networks , 2006 .
[6] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.
[7] Reuven Cohen,et al. Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.
[8] Stephen P. Borgatti,et al. Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.
[9] Panos M. Pardalos,et al. The wireless network jamming problem , 2007, J. Comb. Optim..
[10] Myer Kutz,et al. Handbook of Transportation Engineering , 2003 .
[11] Panos M. Pardalos,et al. Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..
[12] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.