Section: New Results

Formalization of graph algorithms

Participants : Yves Bertot, Cyril Cohen, Ran Chen [Chinese Academy of Science] , Jean-Jacques Lévy [Pi.r2 and Chinese Academy of Science] , Clément Sartori, Laurent Théry.

We studied algorithms to compute strongly connected components in graphs, as a way to prepare a comparative study with the work of Levy and Chen: "A Semi-Automatic Proof of Strong Connectivity" [23].

In a similar vein, Yves Bertot and Clément Sartori have been studying the combinatorial aspects of triangulations, and in particular Delaunay triangulations, seen as graphs. In the long run, we expect this effort to contribute to formal descriptions of Voronoi diagrams and uses in robot motion planning.