4 papers · 1 filter
Fully Dynamic Strongly Connected Components in Planar Digraphs
Adam Karczmarz, Marcin Smulewicz
In this paper, we consider maintaining strongly connected components (SCCs) of a directed planar graph subject to edge insertions and deletions. We show a data structure maintainin…
Computing treedepth in polynomial space and linear fpt time
Wojciech Nadara, Michał Pilipczuk, Marcin Smulewicz
The treedepth of a graph is the least possible depth of an elimination forest of : a rooted forest on the same vertex set where every pair of vertices adjacent in is bou…
Determining 4-edge-connected components in linear time
Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz +1
In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-e…
Many visits TSP revisited
Łukasz Kowalik, Shaohua Li, Wojciech Nadara +2
We study the Many Visits TSP problem, where given a number for each of cities and pairwise (possibly asymmetric) integer distances, one has to find an optimal tour that…