Paths and flows for centrality measures in networks

Daniela Bubboloni, Michele Gori

We consider the number of paths that must pass through a subset $X$ of vertices of a network $N$ in a maximum sequence of arc-disjoint paths connecting two vertices $y$ and $z$. We…