CONGEST is a model in which computers distributed over a network graph have to efficiently exchange quantified information in order to solve a problem. One of its most natural problems is the detection of subgraphs in the network.
In this talk will be given an overview of the problem of cycle detection in the CONGEST model and especially of our latest state-of-the-art algorithm for even-length cycles. If the time allows, the quantum approach to quadratically speed up the detection will also be addressed.
Localisation
Salle de séminaire 4B125 (bâtiment Copernic)
5 Boulevard Descartes 77420 Champs-sur-Marne