Efficient Algorithm for Maximal Clique Size Evaluation

A large dataset network is considered for computation of maximal clique size (MC). Additionally, its link with popular centrality metrics to decrease uncertainty and complexity and for finding influential points of any network has also been investigated. Previous studies focus on centrality metrics like degree centrality (DC), closeness centrality (CC), betweenness centrality (BC) and Eigenvector centrality (EVC) and compare them with maximal clique size however, in this study Katz centrality measure is also considered and shows a pretty robust relation with maximal clique size (MC). Secondly, maximal clique size (MC) algorithm is also revised for network analysis to avoid complexity in computation. Association between MC and five centrality metrics has been evaluated through recognized methods that are Pearson’s correlation coefficient (PCC), Spearman’s correlation coefficient (SCC) and Kendall’s correlation coefficient (KCC). The strong strength of association between them is seen through all three correlation coefficients measure.

@article{Fatima2019,
  title     = {Efficient Algorithm for Maximal Clique Size Evaluation},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {10},
  number    = {7},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {Ubaida Fatima and Saman Hina},
  doi       = {10.14569/IJACSA.2019.0100761},
  url       = {https://doi.org/10.14569/IJACSA.2019.0100761}
}