GALaC team at LRI, Paris-Sud

GALaC is a research group at LRI, Paris-Sud University. We are focused on graph theory, combinatorics and network distributed systems algorithmic.

A global presentation of research activities in GALaC was made in 2013 for the AERES evaluation: Slides AERES 2013 and projet.

Recent Posts

Séries génératrices et preuves d'intrinsèque ambiguïté

-- Florent Koechlin (LORIA Univ. Nancy) (LIX)

Cet exposé porte sur la connexion entre l'intrinsèque ambiguïté en théorie des langages formels, et les propriétés des séries génératrices des langages associés. Il est bien connu que les langages réguliers ont des séries génératrices rationnelles et que les séries génératrices des langages algébriques non ambigus sont algébriques. Dans ...


Proper vertex coloring with odd occurence - Probabilistic approach

-- Qiancheng Ouyang (LISN)

summary: In graph theory, a graph coloring is an assignment of colors to elements of a graph subject to certain constraints. A vertex coloring is said to be proper if any pair of two adjacent vertices are assigned distinct colors. For a graph G, the chromatic number χ(G) is ...

Some results on directed coloring

-- Thomas Bellitto (LIP6, Sorbonne University)

summary: Proper coloring of undirected graphs lies among the most studied problems in graph theory. It asks to color vertices while giving different colors to adjacent ones.
In 1982, Neumann-Lara introduced a generalization of this problem to directed graphs. When walking in an undirected graph, an undirected edge between two ...

Associaèdres cycliques et degrés intrinsèques des arborescences non-croisées

-- Germain Poullot (LIX)

Le polytope de pivot d'un polytope P est une généralisation de son polytope des chemins monotones qui vise a capturer le comportement de la "shadow vertex rule" (une règle de pivot importante en optimisation linéaire et dans le domaine des polytopes de fibre). Il a récemment été montré que ...

See all

Translations: fr