2026.01.06, Daniel Mock, A Simple Algorithm for the Dominating Set Problem and More скачать в хорошем качестве

2026.01.06, Daniel Mock, A Simple Algorithm for the Dominating Set Problem and More

Daniel Mock, A Simple Algorithm for the Dominating Set Problem and More January 6 Tuesday @ 4:30 PM - 5:30 PM KST Room B332, IBS (기초과학연구원) Daniel Mock RWTH Aachen https://tcs.rwth-aachen.de/users/mock/ In [1], Fabianski et. al. developed a simple, yet surprisingly powerful algorithmic framework to develop efficient parameterized graph algorithms. Notably they derive a simple parameterized algorithm for the dominating set problem on a variety of graph classes, including powers of nowhere dense classes and biclique-free classes. These results encompass a wide range of previously known results and often improve the best known running times. Similar results follow for the distance-r variation of dominating set and for independent set. The running time of the algorithm is closely tied to model-theoretic properties, i.e. stability and the Helly property. We build upon these results and develop a similar algorithm which only relies on the strong Helly property and does not need stability. For the dominating set problem, we get a parameterized algorithm that works (additionally to biclique-free classes and powers of nowhere dense classes) weakly gamma-closed classes while being simpler and faster than previously known results. In this talk, we introduce the basic framework, results by Fabianski et. al and connections to other areas. We discuss our new insights and possible research directions. [1] Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk: Progressive Algorithms for Domination and Independence. STACS 2019