A connectivity rating for vertices in networks
- Autores
- Abraham, Marco; Krumnack, Antje; Wanke, Egon; Kötter, Rolf
- Año de publicación
- 2006
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Neural nets
Graphs and networks - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/24422
Ver los metadatos del registro completo
id |
SEDICI_1f3f628d4dea14449ab405e9212fa778 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/24422 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
A connectivity rating for vertices in networksAbraham, MarcoKrumnack, AntjeWanke, EgonKötter, RolfCiencias InformáticasNeural netsGraphs and networksWe 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.4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24422enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:50Zoai:sedici.unlp.edu.ar:10915/24422Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:51.071SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
A connectivity rating for vertices in networks |
title |
A connectivity rating for vertices in networks |
spellingShingle |
A connectivity rating for vertices in networks Abraham, Marco Ciencias Informáticas Neural nets Graphs and 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 |
A connectivity rating for vertices in networks |
dc.creator.none.fl_str_mv |
Abraham, Marco Krumnack, Antje Wanke, Egon Kötter, Rolf |
author |
Abraham, Marco |
author_facet |
Abraham, Marco Krumnack, Antje Wanke, Egon Kötter, Rolf |
author_role |
author |
author2 |
Krumnack, Antje Wanke, Egon Kötter, Rolf |
author2_role |
author author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Neural nets Graphs and networks |
topic |
Ciencias Informáticas Neural nets Graphs and networks |
dc.description.none.fl_txt_mv |
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. 4th IFIP International Conference on Theoretical Computer Science Red de Universidades con Carreras en Informática (RedUNCI) |
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. |
publishDate |
2006 |
dc.date.none.fl_str_mv |
2006-08 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/24422 |
url |
http://sedici.unlp.edu.ar/handle/10915/24422 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844615818100342784 |
score |
13.070432 |