Clearing directed subgraphs by mobile agents: variations on covering with paths
Dariusz Dereniowski , Andrzej Lingas , Dorota Osula , Mia Persson , Paweł Żyliński
AbstractWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V H ,A H ) of D such that (a) S⊆V H , (b) H is the union of k directed walks in D, and (c) the underlying graph of H includes a Steiner tree for S in D. Since a directed walk is a not necessarily a simple directed path, the problem is actually on covering with paths. We provide several results on the polynomial time tractability, hardness, and parameterized complexity of the problem. Our main fixed-parameter algorithm is randomized.
|Journal series||Journal of Computer and System Sciences, ISSN 0022-0000, (N/A 100 pkt)|
|Publication size in sheets||0.55|
|Keywords in English||covering with paths, FPT-algorithm, NP-hardness, monomial|
|ASJC Classification||; ; ;|
|Score||= 100.0, 30-09-2019, ArticleFromJournal|
|Publication indicators||: 2016 = 1.768; : 2017 = 1.497 (2) - 2017=1.914 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.