A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Routing under Balance
[article]
2016
arXiv
pre-print
We introduce the notion of balance for directed graphs: a weighted directed graph is α-balanced if for every cut S ⊆ V, the total weight of edges going from S to V∖ S is within factor α of the total weight of edges going from V∖ S to S. Several important families of graphs are nearly balanced, in particular, Eulerian graphs (with α = 1) and residual graphs of (1+ϵ)-approximate undirected maximum flows (with α=O(1/ϵ)). We use the notion of balance to give a more fine-grained understanding of
arXiv:1603.09009v1
fatcat:nwonzg3sgvaavh5ob3rb4nhvdu