A Generalization of the Importance of Vertices for an Undirected Weighted Graph
Archivos
Fecha
2021
Profesor Guía
Formato del documento
Articulo
ORCID Autor
Título de la revista
ISSN de la revista
Título del volumen
Editor
MDPI
ISBN
ISSN
item.page.issne
item.page.doiurl
Departamento o Escuela
Escuela de Ingenieria Civil Informatica
Determinador
Recolector
Especie
Nota general
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.
Descripción
Lugar de Publicación
Auspiciador
Palabras clave
EDGE-WEIGHTED GRAPH, VERTEX IMPORTANCE, COMPLEX NETWORKS
Licencia
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).