Comprehensive Weighted Clique Degree Ranking Algorithms and Evolutionary Model of Complex Network
This paper analyses the degree ranking (DR) algorithm, and proposes a new comprehensive weighted clique degree ranking (CWCDR) algorithms for ranking importance of nodes in complex network. Simulation results show that CWCDR algorithms not only can overcome the limitation of degree ranking algorithm...
Main Authors: | Xu Jie, Liu Zhen, Xu Jun |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2016-01-01
|
Series: | MATEC Web of Conferences |
Online Access: | http://dx.doi.org/10.1051/matecconf/20167101004 |
Similar Items
-
Dynamically Weighted Clique Evolution Model in Clique Networks
by: Zhang-Wei Li, et al.
Published: (2013-01-01) -
Degree correlations in graphs with clique clustering
by: Dobson, S., et al.
Published: (2022) -
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
by: Ping Guo, et al.
Published: (2019-01-01) -
An Algorithm for the Minimum Weighted Dominating Clique Problem on Trapezoid Graphs
by: Lee, Fang Yeu, et al.
Published: (1994) -
Mathematical Foundations and Algorithms for Clique Relaxations in Networks
by: Pattillo, Jeffrey
Published: (2012)