Login / Signup
Constant congestion brambles in directed graphs.
Tomás Masarík
Marcin Pilipczuk
Pawel Rzazewski
Manuel Sorge
Published in:
CoRR (2021)
Keyphrases
</>
directed graph
random walk
maximum flow
directed acyclic graph
real time
ip networks
graph structure
packet loss
undirected graph
strongly connected
congestion avoidance
machine learning
travel time
congestion control
disjoint paths