1 citations · 1 across the 2 of their papers we have counts for
4 papers
Efficiently Computing Directed Minimum Spanning Trees
Maximilian Böther, Otto Kißig, Christopher Weyand
Computing a directed minimum spanning tree, called arborescence, is a fundamental algorithmic problem, although not as common as its undirected counterpart. In 1967, Edmonds discus…
An Efficient Branch-and-Bound Solver for Hitting Set
Thomas Bläsius, Tobias Friedrich, David Stangl +1
The hitting set problem asks for a collection of sets over a universe to find a minimum subset of that intersects each of the given sets. It is NP-hard and equivalent to th…
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…
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…