2 papers
cs.DC2022
Mending Partial Solutions with Few Changes
Darya Melnyk, Jukka Suomela, Neven Villani
In this paper, we study the notion of mending, i.e. given a partial solution to a graph problem, we investigate how much effort is needed to turn it into a proper solution. For exa…
cs.DC2021
Local Mending
Alkida Balliu, Juho Hirvonen, Darya Melnyk +3
In this work we introduce the graph-theoretic notion of mendability: for each locally checkable graph problem we can define its mending radius, which captures the idea of how far o…