A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network
DOI10.1016/J.APM.2016.07.008zbMATH Open1446.05082OpenAlexW2492135992MaRDI QIDQ2290278FDOQ2290278
Authors: Yanyan Li 
Publication date: 27 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2016.07.008
Recommendations
- Ranking in evolving complex networks
- An evolving network model from clique extension
- scientific article; zbMATH DE number 7338857
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept
- A new multiobjective evolutionary algorithm for community detection in dynamic complex networks
Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Collective dynamics of `small-world' networks
- Exploring complex networks
- Renormalization group analysis of the small-world network model
- The centrality index of a graph
- On the strength of connectedness of a random graph
- A local-world evolving network model
Cited In (1)
This page was built for publication: A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290278)
