Spectral bounds for graph partitioning with prescribed partition sizes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2019

Spectral bounds for graph partitioning with prescribed partition sizes

Résumé

Given an undirected edge weighted graph, the graph partitioning problem consists in determining a partition of the node set of the graph into subsets of prescribed sizes, so as to maximize the sum of the weights of the edges having both endpoints in the same subset. We introduce a new class of bounds for this problem relying on the full spectral information of the weighted adjacency matrix . The expression of these bounds involves the eigenvalues and particular geometrical parameters defined using the eigenvectors of . A connection is established between these parameters and the maximum cut problem. We report computational results showing that the new bounds compare favorably with previous bounds in the literature.
Fichier principal
Vignette du fichier
S0166218X19302884.pdf (477.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02193294 , version 1 (21-12-2021)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Miguel F Anjos, José Neto. Spectral bounds for graph partitioning with prescribed partition sizes. Discrete Applied Mathematics, 2019, 269, pp.200-210. ⟨10.1016/j.dam.2019.06.007⟩. ⟨hal-02193294⟩
72 Consultations
49 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More