In this work, we focus on partitioning dynamic graphs with two types of nodes (bi-colored), though not necessarily bipartite graphs. They commonly appear in communication network applications, e.g., one color being base stations, the other users, and the dynamic process being the varying connection status between base stations and moving users. We introduce a partition cost function that incorporates the coloring of the graph and propose solutions based on the generalized eigenvalue problem (GEVP) for the static two-way partition problem. The static multi-way partition problem is then handled by a heuristic based on the two-way partition problem. Regarding the adaptive partition, an eigenvector update-based method is proposed. Numerical experiments demonstrate the performance of the devised approaches.
|Title of host publication||30th European Signal Processing Conference, EUSIPCO 2022 - Proceedings|
|Publisher||European Signal Processing Conference, EUSIPCO|
|Number of pages||5|
|Publication status||Published - 2022|
|Event||30th European Signal Processing Conference, EUSIPCO 2022 - Belgrade, Serbia|
Duration: 29 Aug 2022 → 2 Sep 2022
|Name||European Signal Processing Conference|
|Conference||30th European Signal Processing Conference, EUSIPCO 2022|
|Period||29/08/22 → 2/09/22|
Bibliographical noteGreen Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
- dynamic graphs
- generalized eigenvalue problem
- graph partitioning
- spectral clustering