Category: seminars

(Reported to unkwown date) The Bron-Kerbosch algorithm with vertex ordering is output sensitive.

-- George Manoussakis (University of Versailles)

summary: The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash ...

(Reported to unkwown date) Programming computing media

-- Frédéric Gruau (LRI)

summary: We consider computing media consisting of billions of small identical Processing Elements (PE) communicating locally in space, and with an homogeneous and isotropic distribution. Computing media can scale arbitrary in size. Thus, they represent parallel architectures whose power can grow without limit. However, programming computing media is difficult.

In ...

TBA

-- Sylvie Corteel (CNRS et IRIF, Université Paris Diderot)

TBA

Efficient generation of rectangulations and elimination trees via permutation languages

-- Arturo Merino (Technische Universität Berlin)

In this talk we apply the Hartung-Hoang-Mütze-Williams permutation language framework to derive exhaustive generation algorithms for two further classes of combinatorial objects, as well as Hamilton paths and cycles on the corresponding polytopes: (3) different classes of rectangulations, which are subdivisions of a rectangle into smaller rectangles (see www.combos ...

Combinatorial generation via permutation languages

-- Torsten Mütze (University of Warwick)

In this talk we present a versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This framework provides a unified view on many known Gray code results and allows us to prove many new ones, and it yields efficient algorithms ...

Enumération des cartes planaires à trois bords par découpage en tranches

-- Emmanuel Guitter (Institut de Physique Théorique IPhT)

Parmi toutes les techniques d’énumération des cartes planaires (graphes plongés sur la sphère à deux dimensions), une des approches conceptuellement les plus simples et directes consiste à découper la carte en tranches: si on dispose d’une règle canonique de découpage et que les tranches ainsi obtenues sont faciles ...

Self-Stabilization and Byzantine Tolerance for Maximal Independent Set

-- Jonas Sénizergues (LISN, Galac)

summary: We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau for computing such a vertex set. Our algorithm is self-stabilizing, and also works under the more difficult context of arbitrary ...

A counting argument for graph colouring

-- Francois Pirot (LISN, Galac)

summary: In 2010, Moser and Tardos introduced an algorithmic version of the celebrated Lovász Local Lemma using the entropy compression method. Their method is now widely used in the community and has become a standard of the probabilistic method, mainly because it often provides the tightest existential bounds. However, it ...

Modèles de dimères sur graphes minimaux : au-delà du cas elliptique

-- Cédric Boutillier (Sorbonne université)

Les modèles de dimères sur les graphes planaires ont fait leur début en tant qu'objet d'étude mathématique avec les travaux de Kasteleyn dans les années 1960. Au début des années 2000, d'importants résultats théoriques sont démontrés, dont deux résultats dans des directions différentes : - la construction du diagramme ...

L’arbre brownien parabolique

-- Nicolas Broutin (Sorbonne Universite)

Je présenterai une construction explicite d'un arbre réel aléatoire à partir d'un mouvement brownien avec drift parabolique. L'objet obtenu est intimement lié au graphes aléatoires et au coalescent multiplicatif, et est distribué comme la limite d'échelle de l'arbre couvrant minimal du graphe complet. On y ...

Page 1 / 16 »