Distributed graph problems through an automata-theoretic lens

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.authorChang, Yi Jun
dc.contributor.authorStudený, Jan
dc.contributor.authorSuomela, Jukka
dc.contributor.departmentNational University of Singapore
dc.contributor.departmentDepartment of Computer Science
dc.contributor.departmentComputer Science Professors
dc.date.accessioned2023-03-15T07:10:46Z
dc.date.available2023-03-15T07:10:46Z
dc.date.issued2023-03-24
dc.descriptionPublisher Copyright: © 2023 The Author(s)
dc.description.abstractThe locality of a graph problem is the smallest distance T such that each node can choose its own part of the solution based on its radius-T neighborhood. In many settings, a graph problem can be solved efficiently with a distributed or parallel algorithm if and only if it has a small locality. In this work we seek to automate the study of solvability and locality: given the description of a graph problem Π, we would like to determine if Π is solvable and what is the asymptotic locality of Π as a function of the size of the graph. Put otherwise, we seek to automatically synthesize efficient distributed and parallel algorithms for solving Π. We focus on locally checkable graph problems; these are problems in which a solution is globally feasible if it looks feasible in all constant-radius neighborhoods. Prior work on such problems has brought primarily bad news: questions related to locality are undecidable in general, and even if we focus on the case of labeled paths and cycles, determining locality is PSPACE-hard (Balliu et al., PODC 2019). We complement prior negative results with efficient algorithms for the cases of unlabeled paths and cycles and, as an extension, for rooted trees. We study locally checkable graph problems from an automata-theoretic perspective by representing a locally checkable problem Π as a nondeterministic finite automaton M over a unary alphabet. We identify polynomial-time-computable properties of the automaton M that near-completely capture the solvability and locality of Π in cycles and paths, with the exception of one specific case that is co-NP-complete.en
dc.description.versionPeer revieweden
dc.format.mimetypeapplication/pdf
dc.identifier.citationChang , Y J , Studený , J & Suomela , J 2023 , ' Distributed graph problems through an automata-theoretic lens ' , Theoretical Computer Science , vol. 951 , 113710 . https://doi.org/10.1016/j.tcs.2023.113710en
dc.identifier.doi10.1016/j.tcs.2023.113710
dc.identifier.issn0304-3975
dc.identifier.otherPURE UUID: f538d9c3-d669-4506-bb87-66b4aa911033
dc.identifier.otherPURE ITEMURL: https://research.aalto.fi/en/publications/f538d9c3-d669-4506-bb87-66b4aa911033
dc.identifier.otherPURE LINK: http://www.scopus.com/inward/record.url?scp=85148698479&partnerID=8YFLogxK
dc.identifier.otherPURE FILEURL: https://research.aalto.fi/files/103090485/SCI_Chang_etal_TCS_2023.pdf
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/120112
dc.identifier.urnURN:NBN:fi:aalto-202303152438
dc.language.isoenen
dc.publisherELSEVIER SCIENCE B.V.
dc.relation.ispartofseriesTheoretical Computer Scienceen
dc.relation.ispartofseriesVolume 951en
dc.rightsopenAccessen
dc.subject.keywordAlgorithm synthesis
dc.subject.keywordAutomata theory
dc.subject.keywordComputational complexity
dc.subject.keywordDistributed algorithms
dc.subject.keywordLCL problems
dc.subject.keywordLOCAL model
dc.titleDistributed graph problems through an automata-theoretic lensen
dc.typeA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessäfi
dc.type.versionpublishedVersion
Files