Organize Suç ve Terör Örgütleri ile Mücadelede Önleyici Đstihbarat Hizmeti için Matematiksel Yaklaşım

Başlangıç: 2015
Yayıncı: Karamanoğlu Mehmetbey Üniversitesi

Bu çalışmada organize suç ve terör örgütleri içyapılarının simetrik ve asimetrik durumları karşısında organizasyon içindeki kilit oyuncunun nasıl bulunacağına dair yöntemler gösterilmiştir.

A Mathematical Approach to the Preventive Intelligence Service Designed for the Encounter with the Organized Criminal and Terror Enterprise

In this work methods how to find the key player in the organization are illustrated in case of symetrical and asymetrical circumtances of the inner structure of the organized criminal and terror enterprise.

PDF

___

Ballester, C. –Calvo-Armengol, A. –Zenou, Y. (2006), “Who’s Who Đn Networks. Wanted: The Key Player”, Econometrica, Cilt: 74, Sayı: 5, S: 1403-1417
Bukard, R. E. –Krarup, J. (1998), “A Linear Algorithm Fort He Pos/Neg-Weighted 1-Median Problem On A Cactus”, Computing, Sayı: 60, S: 193-215
Cheng, Y. –Kang, L. –Lu, C. (2010), “The Pos/Neg-Weighted 1-Median Problem On Tree Graphs With Subtree-Shaped Customers”, Theoretical Computer Science, S: 1038-1044
Krebs, V. (2002), “Unlocking Terrorist Networks”, First Monday, cilt:7, sayı:4, http://journals.uic.edu/ojs/index.php/fm/article/view/ 941 (15.10.2013)
Puerto, J. – Tamır, A. –Mesa, J. A. – Perez-Brıto, D. (2008), “Center Location Problems On Tree Graphs With Subtree-Shaped Customers”, Sayı: 156, S: 2890-2910
Zhang, X. –Kang, L. –Cheng Y. (2010), “The Pos/Neg- Weighted Median Problem On Block Graphs With Subgraph-Shaped Customers”, Computing, Sayı:88, S: 97- 110
Zmazek, B. –Zerovnık, J. (2004), “The Obnoxious Center Problem on Weighted Cactus Graphs”, Discrete Applied Mathematics, sayı: 136, s: 377-386