Practical Issues and Algorithms for Analyzing Terrorist Networks 1
暂无分享,去创建一个
David Shallcross | George Karakostas | Tami Carpenter | D. Shallcross | George Karakostas | T. Carpenter
[1] John Beidler,et al. Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.
[2] Monika Henzinger,et al. Improved Data Structures for Fully Dynamic Biconnectivity , 2000, SIAM J. Comput..
[3] Giuseppe F. Italiano,et al. Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[4] Gérard Cornuéjols,et al. The traveling salesman problem in graphs with 3-edge cutsets , 1985, JACM.
[5] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.
[6] Jan van Leeuwen,et al. Maintenance of 2- and 3-edge- connected components of graphs I , 1993, Discret. Math..
[7] Han La Poutré,et al. Maintenance of 2- and 3-Edge-Connected Components of Graphs II , 2000, SIAM J. Comput..
[8] David Eppstein,et al. Fast approximation of centrality , 2000, SODA '01.
[9] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[10] D. Bienstock,et al. Algorithmic Implications of the Graph Minor Theorem , 1995 .
[11] M. Zelen,et al. Rethinking centrality: Methods and examples☆ , 1989 .
[12] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.
[13] Uri Zwick,et al. All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.
[14] U. Brandes. A faster algorithm for betweenness centrality , 2001 .