Computing, Telecommunication and Control Информатика, телекоммуникации и управление 2687-0517 16 Graph partitioning with minimization of average travel in subgraphs Разбиение графа с минимизацией средних перемещений в подграфах Urakov Ayrat urakov@ufanet.ru Timeryaev Timofey timeryaev@yandex.ru 10 10 2011 5 133 96 99

The problem of partitioning weighted graph into given number of subgraps with minimization the value of average travel in subgraphs is considering. For the problem solve presented multilevel algorithm.

 graph partitioning graph approximation multilevel algorithm mass service optimization