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 email@example.com mailing list with the following title "SUBSCRIBE firstname.lastname@example.org" LastName FirstNale
Unsubscribe to email@example.com mailing list with the following title with the following title "UNSUBSCRIBE firstname.lastname@example.org"
Recent and up-coming seminars
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 ...
The coloring problem in clique-hypergraphs of graphs
ABSTRACT: A maximal clique of a graph is a clique not properly contained in any other clique. A \(k\)-clique coloring of a graph is an assignment of a \(k\) colors to the vertices of \(G\) such that no maximal clique with at least two vertices is monochromatic. The clique-chromatic ...
Minimizing the number of unhappy singles
Abstract: We consider the problem of computing a large stable matching in a bipartite graph G = (A\cup B, E) where each vertex u \in A\cup B ranks its neighbors in an order of preference, perhaps involving ties. A matching M is said to be stable if there is ...