Dynamic Bi-Colored Graph Partitioning
conference paper
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.
Topics
dynamic graphsgeneralized eigenvalue problemgraph partitioningspectral clusteringClustering algorithmsCost functionsEigenvalues and eigenfunctionsGraph theorySignal processingBipartite graphsCommunications networksDynamic graphDynamic processGeneralized eigenvalue problemsGraph PartitioningNetwork applicationsPartition problemSpectral clusteringTwo waysBase stations
TNO Identifier
978184
ISSN
22195491
ISBN
9789082797091
Publisher
European Signal Processing Conference, EUSIPCO
Source title
European Signal Processing Conference, 30th European Signal Processing Conference, EUSIPCO 2022, 29 August 2022 through 2 September 2022
Pages
692-696
Files
To receive the publication files, please send an e-mail request to TNO Repository.