Title
Dynamic Bi-Colored Graph Partitioning
Author
He, Y.
Coutino, M.
Isufi, E.
Leus, G.
Publication year
2022
Abstract
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.
Subject
dynamic graphs
generalized eigenvalue problem
graph partitioning
spectral clustering
Clustering algorithms
Cost functions
Eigenvalues and eigenfunctions
Graph theory
Signal processing
Bipartite graphs
Communications networks
Dynamic graph
Dynamic process
Generalized eigenvalue problems
Graph Partitioning
Network applications
Partition problem
Spectral clustering
Two ways
Base stations
To reference this document use:
http://resolver.tudelft.nl/uuid:aaf76357-10c9-4d36-91a0-2d061bed195a
TNO identifier
978184
Publisher
European Signal Processing Conference, EUSIPCO
ISBN
9789082797091
ISSN
2219-5491
Source
European Signal Processing Conference, 30th European Signal Processing Conference, EUSIPCO 2022, 29 August 2022 through 2 September 2022, 692-696
Document type
conference paper