News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Document

A connectivity rating for vertices in networks

Abraham, Marco et al · SEDICI UNLP · 2006

Supplementary material available
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Abraham, Marco et al
Publisher
SEDICI UNLP
Year
2006
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Supplementary material available

El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Open material

Summary

Descripción general del contenido del recurso.

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)

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Abraham, M. E. A. (2006). A connectivity rating for vertices in networks. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/24422

MLA

Abraham, Marco et al. A connectivity rating for vertices in networks. SEDICI UNLP, 2006. http://sedici.unlp.edu.ar/handle/10915/24422.

Chicago

Abraham, Marco et al. 2006. A connectivity rating for vertices in networks. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/24422.

Harvard

Abraham, M. E. A. 2006, A connectivity rating for vertices in networks, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/24422 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
A connectivity rating for vertices in networks
Author / contributors
Abraham, Marco et al
Publisher
SEDICI UNLP
Publication year
2006
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Neural nets; Graphs and networks
Copied