Plateau Saclay Algorithms Seminar
The Plateau Saclay Algorithms Seminar is held every other Friday afternoon in LIX. This working group is partially supported by Labex DigiCosme (Digital worlds: distributed data, programs and architectures).
If you do wish (or not) to receive any emails from this seminar, you can subscribe or unsubscribe from the mailing list.
Subscribe to firstname.lastname@example.org mailing list with the following title "SUBSCRIBE email@example.com" LastName FirstNale
Unsubscribe to firstname.lastname@example.org mailing list with the following title with the following title "UNSUBSCRIBE email@example.com"
Recent and up-coming seminars
Matchings and related structures with Specified Color Properties In Vertex- or Edge-colored Graphs.
summary: We consider problems in edge- or vertex colored graphs. As an example, the Web graph may be considered as a vertex-colored graph where the color of a vertex represents the content of the corresponding page (red for mathematics, yellow for physics, etc.). When the edges/vertices of graphs are ...
The Domino Problem is undecidable on surface groups
summary: The domino problem for a finitely generated group asks whether there exists an algorithm which takes as input a finite alphabet and finitely many Wang tiles, and decides whether there exists a tiling of the group by this set of tiles. I will survey known results and present the ...
VERTEX DISTINGUISHING COLORINGS OF GRAPHS
Abstract : Let us consider a coloring \(f\) of edges in a simple graph \(G = (V, E)\). Such acoloring deﬁnes for each vertex \(x \in V\) the palette of colors, i.e., the multiset of colors of edges incident with \(x\), denoted by \(S(x)\). These palettes can be used to ...