Recent results and open problems in spectral algorithms for signed graphs
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
2021-08-28
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
4
Series
Proceedings of the 3rd BYMAT Conference, pp. 215-218, TEMat monográficos ; Volume 2
Abstract
In signed graphs, edges are labeled with either a positive or a negative sign.This small modification greatly enriches the representation capabilities of graphs.However, their spectral properties undergo significant changes, introducing newchallenges in related optimization problems. In this extended abstract we discussrecent results in spectral methods for signed graph partitioning and communitydetection, and propose open problems arising in this context.Description
| openaire: EC/H2020/871042/EU//SoBigData-PlusPlus
Keywords
Other note
Citation
Ordozgoiti Rubio, B 2021, Recent results and open problems in spectral algorithms for signed graphs . in Proceedings of the 3rd BYMAT Conference . TEMat monográficos, vol. 2, Asociación Nacional de Estudiantes de Matemáticas, pp. 215-218, Bringing Young Mathematicians Together, Virtual, Online, 01/12/2020 . < https://temat.es/monograficos/article/view/vol2-p215 >