Busque entre los 167304 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-20T16:27:01Z | |
dc.date.available | 2012-11-20T16:27:01Z | |
dc.date.issued | 2006-08 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/24422 | |
dc.description.abstract | 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. | en |
dc.language | en | es |
dc.subject | Neural nets | es |
dc.subject | Graphs and networks | es |
dc.title | A connectivity rating for vertices in networks | en |
dc.type | Objeto de conferencia | es |
sedici.identifier.isbn | 0-387-34633-3 | es |
sedici.creator.person | Abraham, Marco | es |
sedici.creator.person | Krumnack, Antje | es |
sedici.creator.person | Wanke, Egon | es |
sedici.creator.person | Kötter, Rolf | es |
sedici.description.note | 4th IFIP International Conference on Theoretical Computer Science | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2006-08 | |
sedici.relation.event | 19 th IFIP World Computer Congress - WCC 2006 | es |
sedici.description.peerReview | peer-review | es |