Giovedì 27 aprile alle ore 15:30 presso la Sala Riunioni del Plesso di Matematica, il ricercatore Andrea MUNARO terrà un seminario dal titolo:

On graph width parameters.

Abstract: Solving a discrete optimization problem means seeking an optimal solution from finitely many options. Most discrete optimization problems are computationally hard. To overcome this, we may restrict the input and ask: Which input restrictions lead to efficient algorithms? The input is often described by a graph and knowing that this graph has small "width" is useful for designing efficient algorithms for many such problems. In this talk, I will provide a gentle overview on algorithmic and structural results related to graph width parameters. No previous knowledge of Graph Theory will be assumed.

Tutti gli interessati sono invitati a partecipare; al termine del seminario verrà offerto un piccolo rinfresco in Common Room.

Gli organizzatori: Davide Addona, Paolo Baroni, Nicoletta Tardini.