A comprehensive analysis of the correlation between maximal clique size and centrality metrics for complex network graphs
We seek to identify one or more computationally light-weight centrality metrics that have a high correlation with that of the maximal clique size (the maximum size of the clique a node is part of) - a computationally hard measure. In this pursuit, we compute three well-known measures of evaluating t...
Main Author: | Natarajan Meghanathan |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-09-01
|
Series: | Egyptian Informatics Journal |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1110866516300305 |
Similar Items
-
On clique convergence of graphs
by: S.M. Hegde, et al.
Published: (2016-12-01) -
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
by: Charles A. Phillips, et al.
Published: (2019-01-01) -
Creating a Maximal Clique Graph to Improve Community Detection in SCoDA and OSLOM Algorithms
by: Sasan Sabour, et al.
Published: (2019-12-01) -
on the number of cliques and cycles in graphs
by: Mojgan Emami, et al.
Published: (2013-06-01) -
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
by: Napur Patra, et al.
Published: (2021-06-01)