KaydedilenlerDerginizi ekleyin

Dergiler / Turkish Journal of Science and Technology / 2021 / Cilt: 16 - Sayı: 1

4×4 Knight’s Graph Analysis by Modularity A Knight Graph Application

Serkan GÜLDAL
Sayfa
23–30
Yayın Tarihi
2021-03-15
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Also, the analyses show resolution 0.2 is the best resolution to find all solutions of 4-KCP.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Modularity is a well-known technic to analyze graphs of datasets.
📊
Temel Bulgular & Veri:In the present study, we analyze 4×4 knight graph by modularity to investigate 4-KCP solutions.
💡
Sonuç & Katkı:Also, the analyses show resolution 0.2 is the best resolution to find all solutions of 4-KCP.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Knight graph · Modularity · 4-KCP

Abstract

Modularity is a well-known technic to analyze graphs of datasets. The modularity divides the network into meaningful clusters. The clusters present the existence of shared properties between the nodes in the same cluster. In the present study, we analyze 4×4 knight graph by modularity to investigate 4-KCP solutions. Our investigation is completed for resolutions from 0.2 to 3.2. The maximum modularity score is 0.417 found (for resolution = 0.6, 0.8, 1, and 1.4). Moreover, resolution 1.4 is the optimum resolution to find some solutions of 4-KCP. Also, the analyses show resolution 0.2 is the best resolution to find all solutions of 4-KCP.

🔖

Bu Makaleye Atıf Yap

GÜLDAL, S. (2021). 4×4 Knight’s Graph Analysis by Modularity A Knight Graph Application. Turkish Journal of Science and Technology, Cilt: 16 - Sayı: 1, 23–30. https://ajindex.com/articles/807418

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (5)

  1. S. Bai, G. Zhu, and J. Huang, "An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem," in 2013 Ninth International Conference on Computational Intelligence and Security, 2013, pp. 583-588. H. Jian and B. Sen, "An Efficient Algorithm for the Generalized (1,k)-Knight's Tours Problem," in 2009 First International Workshop on Education Technology and Computer Science, 2009, vol. 1, pp. 697-701.
  2. S. Bai, X. Liao, X. Qu, and Y. Liu, "Generalized Knight's Tour Problem and Its Solutions Algorithm," in 2006 International Conference on Computational Intelligence and Security, 2006, vol. 1, pp. 570-573. A. Philip, "A Generalized Pseudo-Knight?s Tour Algorithm for Encryption of an Image," IEEE Potentials, vol. 32, no. 6, pp. 10-16, 2013. J. Kumar and S. Nirmala, "Securing the contents of document images using knight moves and genetic approach," in 2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2015, pp. 1091-1095.
  3. J. Delei, B. Sen, and D. Wenming, "An Image Encryption Algorithm Based on Knight's Tour and Slip Encryption-Filter," in 2008 International Conference on Computer Science and Software Engineering, 2008, vol. 1, pp. 251-255. D. C. Fisher, "On the n x n Knight Cover Problem," Ars Comb., vol. 69, / 2003. F. Rubin, "Improved Knight Coverings," Ars Comb., vol. 69, / 2003. F. Rubin, "Knight Covers for the 50x50 Chessboard," presented at the Mathfest 2004, Providence RI, 2004. F. Rubin, "A Family of Efficient Knight Covering Patterns," Journal of Recreational Mathematics, Article vol. 33, no. 3, pp. 165-175, 2005. F. Rubin, "An Improved Method for Finding Knight Covers," Ars Comb., vol. 82, / 2007. B. Lemaire, "Knights Covers on NxN Chessboards," J. Recr. Math., vol. 31, pp. 87-99, 2003. A. H. Jackson and R. P. Pargas, "Solutions to the NxN Knights Covering Problem," J. Recr. Math., vol. 23, pp. 255-267, 1991. F. Wei, "Research on Knight Covering Based on Breadth First Search Algorithm," (in English), APPLIED MECHANICS AND MATERIALS, vol. 686, pp. 377-380, 2014.
  4. S. Güldal, M. Lipscomb, and M. M. Tanik, "Solving Knights Covering Problem: Backtracking, Permutation, Bipartite Graph, and Independent Set," presented at the Nineteenth Annual Early Career Technical Conference, Birmingham, Alabama USA, 2019
  5. S. Güldal, M. M. Tanik, and M. M. Lipscomb, "Solving Knights Covering Problem by a Hybrid Algorithm," presented at the IEEE SouthEastConn, Huntsville, Alabama, April 11 - 14 2019, S. Güldal, "Connecti