En cours

Séminaire Algorithmique : « Planar or almost planar graphs: topology to the rescue of algorithms », Arnaud de Mesmay (LIGM, Univ. Paris-Est)

Sciences 3- S3 351

Many graphs encountered in practice have a particular structure. For example, road networks have few or no intersections when drawn in a plane. We will see how this type of … Continue reading Séminaire Algorithmique : « Planar or almost planar graphs: topology to the rescue of algorithms », Arnaud de Mesmay (LIGM, Univ. Paris-Est)