Independence ratio by local algorithms

We want to determine the size of the largest independent set on a graph, the d-regular infinite tree. In particular, we want the maximal size achievable by a local algorithm.

Projektvezető adatai
Gerencsér Balázs
Rényi Alfréd Matematikai Kutatóintézet