Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks

DOI10.1142/S0129054120500379zbMath1461.05197OpenAlexW3100758992MaRDI QIDQ5859658

Zeynep Nihan Odabaş Berberler, Aysun Asena Kunt

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120500379

zbMATH Keywords

distanceconnectivitydegreescomplex networksnode importancenetwork agglomeration

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ Agglomeration-Based Node Importance Analysis in Wheel-Type Networks

Cites Work

• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
• Collective dynamics of ‘small-world’ networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks