Efficiently Computing Maximum Flows in Scale-Free Networks.

DOI10.4230/LIPICS.ESA.2021.21arXiv2009.09678OpenAlexW3196597036MaRDI QIDQ6075907

Tobias Friedrich, Christopher Weyand, Thomas Bläsius

Publication date: 20 September 2023

Full work available at URL: https://arxiv.org/abs/2009.09678

zbMATH Keywords

networkgraphsflowscale-free

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Efficiently Computing Maximum Flows in Scale-Free Networks.