Paths and flows for centrality measures in networks

We consider the number of paths that must pass through a subset X of vertices of a capacitated network N in a maximum sequence of arc‐disjoint paths connecting two vertices y and z. We consider then the difference between the maximum flow value from y to z in N and the maximum flow value from y to z...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2022-09, Vol.80 (2), p.216-234
Hauptverfasser:	Bubboloni, Daniela, Gori, Michele
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes arc‐disjoint paths flow betweenness group centrality network flow
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!