The thesis aims to solve graph-coloring problems within different variations of the amoebot model, an abstraction of programmable matter, where a each vertex is a assigned a color matching no neighboring color. Understanding efficient coloring using the underlying structure and restrictions of the amoebot model and comparison with other distributed algorithms is essential for developing higher level algorithms. The central question of the paper is how can we efficiently color the graph induced by regions of amoebots, where many neighboring amoebots build a region and a structure of many of these regions have to be colored and what is the least amount of colors we can use, while not increasing the runtime too much.
Mittwoch, 11.02.2026
| 14.00 bis 14.30 Uhr
Graph coloring in different amoebot models
Ort: F2.419
Veranstalter: Nils Pape, Bachelorantrittsvortrag
Veranstalter: Nils Pape, Bachelorantrittsvortrag