A connectivity rating for vertices in networks

We compute the influence of a vertex on the connectivity structure of a directed network by using Shapley value theory. In general, the computation of such ratings is highly inefficient. We show how the computation can be managed for many practically interesting instances by a decomposition of large...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Abraham, Marco, Krumnack, Antje, Wanke, Egon, Kötter, Rolf
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24422
Aporte de:

Ejemplares similares