Defined in File DynamicBSuitorMatcher.hpp
public NetworKit::BSuitorMatcher
(Class BSuitorMatcher)
public NetworKit::DynAlgorithm
(Class DynAlgorithm)
Public Functions
Implementation from the algorithm from “A Fully-dynamic Approximation Algorithm for Maximum
Weight b-Matchings in Graphs” from Proceedings of The Thirteenth International Conference on Complex Networks and their Applications 2024 by Fabian Brandt-Tumescheit, Frieda Gerharz and Henning Meyerhenke. The algorithm dynamically updates the b-matching based on the b-Suitor algorithm by Khan et al. The solution is the same as a complete recomputation of the b-Suitor b-matching.
G – The graph,
b – List of b-values for each node in the graph.
G – The graph,
b – Set the same b-value for all nodes. Optional and defaults to 1.
Updates the b-matching after an edge insertion or deletion on the graph. Notice: Supported events include edge insertion and deletion.
e – The update event.
Updates the b-matching after a batch of edge insertions or deletions on the graph. Notice: Supported events include edge insertion and deletion.
e – The batch of update events.