3 citations · 5 across the 6 of their papers we have counts for
1 paper · 1 filter
Marcin Bienkowski, Martin Böhm, Martin Koutecký +3
In the online balanced graph repartitioning problem, one has to maintain a clustering of n nodes into ℓ clusters, each having k=n/ℓ nodes. During runtime, an online…