A generalization of the importance of vertices for an undirected weighted graph

Ronald Manríquez, Camilo Guerrero-Nancuante, Felipe Martínez, Carla Taramasco

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

1 Cita (Scopus)

Resumen

Establishing a node importance ranking is a problem that has attracted the attention of many researchers in recent decades. For unweighted networks where the edges do not have any attached weight, many proposals have been presented, considering local or global information of the networks. On the contrary, it occurs in undirected edge-weighted networks, where the proposals to address this problem have been more scarce. In this paper, a ranking method of node importance for undirected and edge-weighted is provided, generalizing the measure of line importance (DIL) based on the centrality degree proposed by Opsahl. The experimentation was done on five real networks and the results illustrate the benefits of our proposal.

Idioma originalInglés
Número de artículo902
PublicaciónSymmetry
Volumen13
N.º5
DOI
EstadoPublicada - may 2021

Áreas temáticas de ASJC Scopus

  • Informática (miscelánea)
  • Química (miscelánea)
  • Matemáticas (todo)
  • Física y astronomía (miscelánea)

Huella

Profundice en los temas de investigación de 'A generalization of the importance of vertices for an undirected weighted graph'. En conjunto forman una huella única.

Citar esto