Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology

[Visio] Séminaire organisé par Foivos Fioravantes (Czech Technical University, Prague) le 14/03/2024.

Attention : Débute à 10 h 30.

Résumé :

A graph G is Hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, for all subsets of vertices S, the number of connected components in G − S is at most |S| / t. In 1973, Chvàtal conjecture the following : There exists a constant t such that every t-tough graphs is Hamiltonian. Let t be a positive integer. A graph G with degree sequence d_1,d_2,…,d_n is P(t) (t being a positive integer) If for all i, t ≤ i < n/2, d_i ≤ i ⇒ d_{n−i+t} ≥ n−i. In 1995, Hoàng conjecture the following : If G is t-tough and P(t) then G is Hamiltonian. Hoàng prove that it is true for t ≤ 3. In 2023, Hoang and Robin proved that it is also true for t ≤ 4 by extending the Closure Lemma due to Bondy and Chvàtal into a version for tough graphs. We prove that it is true for t≤7. To do so, we prove a lemma about covering some vertices of a graph with a bounded number of paths. This is joint work with Chình T. Hoàng and Paul Dorbec.