Efficient Algorithm for Maximal Clique Size Evaluation

Abstract

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.

Authors and Affiliations

Ubaida Fatima, Saman Hina

Keywords

Related Articles

Predicting Fork Visibility Performance on Programming Language Interoperability in Open Source Projects

Despite a variety of programming languages adopted in open source (OS) projects, fork variation on some languages has been minimal and slow to be adopted, and there is little research as to why this is so. We therefore e...

Fast Approximation for Toeplitz, Tridiagonal, Symmetric and Positive Definite Linear Systems that Grow Over Time

Linear systems with tridiagonal structures are very common in problems related not only to engineering, but chemistry, biomedical or finance, for example, real time cubic B-Spline interpolation of ND-images, real time pr...

Performance Evaluation of Network Gateway Design for NoC based System on FPGA Platform

Network on Chip (NoC) is an emerging interconnect solution with reliable and scalable features over the System on Chip (SoC) and helps to overcome the drawbacks of bus-based interconnection in SoC. The multiple cores or...

Achieving High Privacy Protection in Location-based Recommendation Systems

In recent years, privacy has become great attention in the research community. In Location-based Recommendation Systems (LbRSs), the user is constrained to build queries depend on his actual position to search for the cl...

Intelligent Image Watermarking based on Handwritten Signature

With the growth of digital technology over the past decades, the issue of copyright protection has become especially important. Digital watermarking is a suitable way of addressing this issue. The main problem in the are...

Download PDF file
  • EP ID EP611426
  • DOI 10.14569/IJACSA.2019.0100761
  • Views 97
  • Downloads 0

How To Cite

Ubaida Fatima, Saman Hina (2019). Efficient Algorithm for Maximal Clique Size Evaluation. International Journal of Advanced Computer Science & Applications, 10(7), 444-452. https://europub.co.uk/articles/-A-611426