Recent results and open problems in spectral algorithms for signed graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

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.
Original languageEnglish
Title of host publicationProceedings of the 3rd BYMAT Conference
Pages215-218
Number of pages4
Publication statusPublished - 28 Aug 2021
MoE publication typeA4 Article in a conference publication
EventBringing Young Mathematicians Together - Virtual, Online
Duration: 1 Dec 20203 Dec 2020
Conference number: 3
https://bymat.webs.upv.es/index/

Publication series

NameTEMat monográficos
PublisherAsociación Nacional de Estudiantes de Matemáticas
Volume2
ISSN (Electronic)2660-6003

Conference

ConferenceBringing Young Mathematicians Together
Abbreviated titleBYMAT
CityVirtual, Online
Period01/12/202003/12/2020
Internet address

Cite this