In: Theoretical Computer Science, 2021, vol. 877, p. 18-35
In this paper, we study the problem of deciding whether the total domination number of a given graph Gcan be reduced using exactly one edge contraction (called1-Edge Contraction(γt)). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete complexity dichotomy for H-free graphs.
|
In: Boundary-Layer Meteorology, 2015, vol. 155, no. 3, p. 397-416
|
In: Transport in Porous Media, 2015, vol. 110, no. 2, p. 225-250
|
In: International Journal of Biometeorology, 2015, vol. 59, no. 12, p. 1875-1889
|
In: Boundary-Layer Meteorology, 2015, vol. 157, no. 1, p. 81-96
|
In: Boundary-Layer Meteorology, 2015, vol. 155, no. 2, p. 249-270
|
In: Frontiers in Earth Science, 2020, vol. 8, p. -
|
In: 30th International Symposium on Algorithms and Computation (ISAAC) - Leibniz International Proceedings in Informatics, 2019, vol. 149, no. 21, p. 1-14
In this paper, we consider the following problem: given a connected graph G, can we reduce the domination number of G by one by using only one edge contraction? We show that the problem is NP-hard when restricted to {P6, P4 + P2}-free graphs and that it is coNP-hard when restricted to subcubic claw-free graphs and 2P3-free graphs. As a consequence, we are able to establish a complexity dichotomy...
|
In: Boundary-Layer Meteorology, 2014, vol. 151, no. 3, p. 429-451
|
In: Pharmaceutical Research, 2014, vol. 31, no. 12, p. 3415-3425
|