DeepAI AI Chat
Log In Sign Up

The temporal explorer who returns to the base

05/12/2018
by   Eleni C. Akrida, et al.
University of Liverpool
Durham University
0

In this paper we study the problem of exploring a temporal graph (i.e. a graph that changes over time), in the fundamental case where the underlying static graph is a star. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leafs, and eventually returns back to the center. We initiate a systematic study of the computational complexity of this problem, depending on the number k of time-labels that every edge is allowed to have; that is, on the number k of time points where every edge can be present in the graph. To do so, we distinguish between the decision version StarExp(k) asking whether a complete exploration of the instance exists, and the maximization version MaxStarExp(k) of the problem, asking for an exploration schedule of the greatest possible number of edges in the star. We present here a collection of results establishing the computational complexity of these two problems. On the one hand, we show that both MaxStarExp(2) and StarExp(3) can be efficiently solved in O(n log n) time on a temporal star with n vertices. On the other hand, we show that, for every k >= 6, StarExp(k) is NP-complete and MaxStarExp(k) is APX-hard, and thus it does not admit a PTAS, unless P = NP. The latter result is complemented by a polynomial-time 2-approximation algorithm for MaxStarExp(k), for every k, thus proving that MaxStarExp(k) is APX-complete. Finally, we give a partial characterization of the classes of temporal stars with random labels which are, asymptotically almost surely, yes-instances and no-instances for StarExp(k) respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/31/2018

On Exploring Temporal Graphs of Small Pathwidth

We show that the Temporal Graph Exploration Problem is NP-complete, even...
04/21/2021

Acyclic, Star, and Injective Colouring: Bounding the Diameter

We examine the effect of bounding the diameter for well-studied variants...
08/21/2020

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs

A k-colouring c of a graph G is a mapping V(G) to 1,2,... k such that c(...
04/09/2018

Characterizing Star-PCGs

A graph G is called a pairwise compatibility graph (PCG, for short) if i...
02/20/2023

Kernelizing Temporal Exploration Problems

We study the kernelization of exploration problems on temporal graphs. A...
04/25/2022

Some New Results on Efficient and Perfect Edge Domination of Graphs

A neighborhood star-free graph is one in which every vertex of degree at...
04/22/2019

Computational Complexity of Restricted Diffusion Limited Aggregation

We introduce a restricted version of the Diffusion Limited Aggregation (...