Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs

by   Emmanuel Arrighi, et al.

We study the computational complexity of determining structural properties of edge periodic temporal graphs (EPGs). EPGs are time-varying graphs that compactly represent periodic behavior of components of a dynamic network, for example, train schedules on a rail network. In EPGs, for each edge e of the graph, a binary string s_e determines in which time steps the edge is present, namely e is present in time step t if and only if s_e contains a 1 at position t |s_e|. Due to this periodicity, EPGs serve as very compact representations of complex periodic systems and can even be exponentially smaller than classic temporal graphs representing one period of the same system, as the latter contain the whole sequence of graphs explicitly. In this paper, we study the computational complexity of fundamental questions of the new concept of EPGs such as what is the shortest traversal time between two vertices; is there a time step in which the graph (1) is minor-free; (2) contains a minor; (3) is subgraph-free; (4) contains a subgraph; with respect to a given minor or subgraph. We give a detailed parameterized analysis for multiple combinations of parameters for the problems stated above including several parameterized algorithms.


page 1

page 2

page 3

page 4


A Timecop's Chase Around the Table

We consider the cops and robber game variant consisting of one cop and o...

Classifying k-Edge Colouring for H-free Graphs

A graph is H-free if it does not contain an induced subgraph isomorphic ...

Realizing temporal graphs from fastest travel times

In this paper we initiate the study of the temporal graph realization pr...

Kernelizing Temporal Exploration Problems

We study the kernelization of exploration problems on temporal graphs. A...

How fast can we reach a target vertex in stochastic temporal graphs?

Temporal graphs are used to abstractly model real-life networks that are...

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

We study Subgraph Isomorphism on graph classes defined by a fixed forbid...

On the edge-biclique graph and the iterated edge-biclique operator

A biclique of a graph G is a maximal induced complete bipartite subgraph...

Please sign up or login with your details

Forgot password? Click here to reset