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

Detalles Bibliográficos
Autores principales: Abraham, Marco, Krumnack, Antje, Wanke, Egon, Kötter, Rolf
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
Neural nets
Graphs and networks
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24422
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24422
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Neural nets
Graphs and networks
spellingShingle Ciencias Informáticas
Neural nets
Graphs and networks
Abraham, Marco
Krumnack, Antje
Wanke, Egon
Kötter, Rolf
A connectivity rating for vertices in networks
topic_facet Ciencias Informáticas
Neural nets
Graphs and networks
description 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 networks into smaller parts. For undirected networks, we introduce an algorithm that computes all vertex ratings in linear time, if the graph is cycle composed or chordal.
format Objeto de conferencia
Objeto de conferencia
author Abraham, Marco
Krumnack, Antje
Wanke, Egon
Kötter, Rolf
author_facet Abraham, Marco
Krumnack, Antje
Wanke, Egon
Kötter, Rolf
author_sort Abraham, Marco
title A connectivity rating for vertices in networks
title_short A connectivity rating for vertices in networks
title_full A connectivity rating for vertices in networks
title_fullStr A connectivity rating for vertices in networks
title_full_unstemmed A connectivity rating for vertices in networks
title_sort connectivity rating for vertices in networks
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/24422
work_keys_str_mv AT abrahammarco aconnectivityratingforverticesinnetworks
AT krumnackantje aconnectivityratingforverticesinnetworks
AT wankeegon aconnectivityratingforverticesinnetworks
AT kotterrolf aconnectivityratingforverticesinnetworks
AT abrahammarco connectivityratingforverticesinnetworks
AT krumnackantje connectivityratingforverticesinnetworks
AT wankeegon connectivityratingforverticesinnetworks
AT kotterrolf connectivityratingforverticesinnetworks
bdutipo_str Repositorios
_version_ 1764820466046861313

Ejemplares similares