2 papers
cs.DS2020
Efficiently Computing Maximum Flows in Scale-Free Networks
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
We study the maximum-flow/minimum-cut problem on scale-free networks, i.e., graphs whose degree distribution follows a power-law. We propose a simple algorithm that capitalizes on…
cs.DS2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann +3
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs (GIRG) are two similar generative network models that were designed to resemble complex real world networks…