2 papers
cs.DS2024
A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
Fabian Brandt-Tumescheit, Frieda Gerharz, Henning Meyerhenke
Matching nodes in a graph G = (V, E) is a well-studied algorithmic problem with many applications. The b-matching problem is a generalizati on that allows to match a node with up t…
cs.SI2022
Interactive Visualization of Protein RINs using NetworKit in the Cloud
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke +2
Network analysis has been applied in diverse application domains. In this paper, we consider an example from protein dynamics, specifically residue interaction networks (RINs). In…