Online balanced repartitioning

DOI10.1007/978-3-662-53426-7_18zbMath1393.68191OpenAlexW2236077559MaRDI QIDQ1660940

Maciej Pacut, Stefan Schmid, Andreas Loukas, Chen Avin

Publication date: 16 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-53426-7_18

zbMATH Keywords

algorithmsclusteringcompetitive analysisgraph partitioningcloud computingdynamic graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Self-adjusting grid networks ⋮ Competitive vertex recoloring. (Online disengagement) ⋮ Self-adjusting linear networks with ladder demand graph ⋮ Dynamic Balanced Graph Partitioning ⋮ Competitive clustering of stochastic communication patterns on a ring ⋮ Improved analysis of online balanced clustering

This page was built for publication: Online balanced repartitioning