Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring

11/17/2021
by   Till Fluschnik, et al.
0

We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define a bipartite temporal graph as one in which every layer can be 2-colored in a way that results in few changes between any two consecutive layers. This approach follows the framework of multistage problems that has received a growing amount of attention in recent years. We investigate the complexity of recognizing these graphs. We show that this problem is NP-hard even if there are only two layers or if only one change is allowed between consecutive layers. We consider the parameterized complexity of the problem with respect to several structural graph parameters, which we transfer from the static to the temporal setting in three different ways. Finally, we consider a version of the problem in which we only restrict the total number of changes throughout the lifetime of the graph. We show that this variant is fixed-parameter tractable with respect to the number of changes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2023

Realizing temporal graphs from fastest travel times

In this paper we initiate the study of the temporal graph realization pr...
research
03/29/2022

Restless Temporal Path Parameterized Above Lower Bounds

Reachability questions are one of the most fundamental algorithmic primi...
research
02/10/2020

On the Complexity of Constructive Control under Nearly Single-Peaked Preferences

We investigate the complexity of Constructive Control by Adding/Deleting...
research
10/11/2020

On Structural Parameterizations of Load Coloring

Given a graph G and a positive integer k, the 2-Load coloring problem is...
research
03/13/2023

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring

The Square Colouring of a graph G refers to colouring of vertices of a g...
research
12/09/2019

Multistage Graph Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...
research
11/12/2018

Sliding Window Temporal Graph Coloring

Graph coloring is one of the most famous computational problems with app...

Please sign up or login with your details

Forgot password? Click here to reset