1 paper
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…