Posts classified under: Amacc

While rotations are bijections that preserve distances and angles in Euclidean space, these geometric properties are not preserved in general when rotations are applied to digital images. In this talk, we particularlly focus on bijection and topology, which are also generally lost. With regard to bijections, we present the set of rotations that give bijective … Continue reading Séminaire Algorithmique : « How to rotate digital images without losing information? », Yukiko Kenmochi (GREYC, Caen)

Nous montrons dans cet exposé comment obtenir de manière algorithmique un développement asymptotique à tous les ordres pour les systèmes algébriques et donnons quelques clefs pour une généralisation pour certains systèmes différentiellement algébriques.

In 1996, Bruce Reed worked on domination in cubic graphs, and came to the conclusion that 1/3 of the vertices should suffice in dominating connected cubic graphs. Things are not that simple as there are some counter-examples, but the problem still attracted attention (and gave birth to conjectures). In 2008, Lowenstein and Rautenbach made a … Continue reading Séminaire Algorithmique : « Domination in subcubic graphs: swapping numbers », Paul Dorbec (GREYC, Caen)