Tom-Lukas Breitkopf

collaborators

2 papers

cs.DS2026

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density

Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese +2

We study $τ$ -Bounded-Density Edge Deletion ( $τ$ -BDED), where given an undirected graph $G$ , the task is to remove as few edges as possible to obtain a graph $G^{'}$ where no subgraph…

cs.DC2025

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols

Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek +1

This paper revisits a fundamental distributed computing problem in the population protocol model. Provided $n$ agents each starting with an input color in $[k]$ , the relative major…