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
On the complexity of computing tree-partitions
summary: Tree-partitions are graph decompositions that correspond to mapping vertices to nodes of a tree in such a way that adjacent vertices in the graph are either mapped to adjacent nodes of the tree or to the same node. The width of a tree-partition is the maximum number of vertices ...
À la lumière de quelques propriétés essentielles
Cet exposé consistera en quatre parties, chacune commençant par une introduction à un domaine de recherche et terminant par quelques contributions.
Nous débuterons par expliquer comment la conjecture polynomiale de Hales-Jewett à densité unifie plusieurs des généralisations du théorème de van der Waerden, ainsi que comment cette généralisation commune présente ...
On the intervals of framing lattices
summary: A flow graph \(G\) is an acyclic oriented graph with \(V(G) = [n]\), \(E(G)\) a multi-set of edges where each edge \((i,j)\) satisfies \(i<j\), and such that \(G\) has a unique source \(s=1\) and sink \(t=n\). On such a graph, a route is simply ...
Translations: fr