Graphs of Shortest Paths
Naima Mehdi (LIP6, Sorbonne Univ.)In this talk, we will explore graphs of shortest paths—directed acyclic graphs (DAGs) derived from shortest path traversals of a graph rooted at a fixed sour...
Le séminaire a lieu le mardi à 10h45 (sauf modification exceptionnelle), au campus Côte de Nacre, bâtiment Sciences 3, salle S3 351, 3ème étage.
In this talk, we will explore graphs of shortest paths—directed acyclic graphs (DAGs) derived from shortest path traversals of a graph rooted at a fixed sour...
The domatic number of a graph \(G\) is the maximum number of pairwise disjoint dominating sets of \(G\). We are interested in the LP-relaxation of this param...