Efficient identification of node importance based on agglomeration in cycle-related networks
From MaRDI portal
Recommendations
- Agglomeration-Based Node Importance Analysis in Wheel-Type Networks
- A new method for identifying influential nodes and important edges in complex networks
- Determination methods of node importance in complex networks
- Importance identification method of complex network nodes based on betweenness and degree entropy
- Critical network node evaluation based on \(m\)-order neighbor nodes
Cites work
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 6761041 (Why is no real title available?)
- Statistical mechanics of complex networks
- Vertex vulnerability parameter of gear graphs
- Zagreb eccentricity indices of cycles related graphs.
Cited in
(5)- Importance identification method of complex network nodes based on betweenness and degree entropy
- On agglomeration-based rupture degree in networks and a heuristic algorithm
- Agglomeration-Based Node Importance Analysis in Wheel-Type Networks
- Influential node identification of network based on agglomeration operation
- Identifying critical nodes in complex networks based on neighborhood information
This page was built for publication: Efficient identification of node importance based on agglomeration in cycle-related networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859658)
