Sliding Window Temporal Graph Coloring

11/12/2018
by   George B. Mertzios, et al.
0

Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static graphs, which often stand in stark contrast to practice where data is inherently dynamic and subject to discrete changes over time. A temporal graph is a graph whose edges are assigned a set of integer time labels, indicating at which discrete time steps the edge is active. In this paper we present a natural temporal extension of the classical graph coloring problem. Given a temporal graph and a natural number Δ, we ask for a coloring sequence for each vertex such that (i) in every sliding time window of Δ consecutive time steps, in which an edge is active, this edge is properly colored (i.e. its endpoints are assigned two different colors) at least once during that time window, and (ii) the total number of different colors is minimized. This sliding window temporal coloring problem abstractly captures many realistic graph coloring scenarios in which the underlying network changes over time, such as dynamically assigning communication channels to moving agents. We present a thorough investigation of the computational complexity of this temporal coloring problem. More specifically, we prove strong computational hardness results, complemented by efficient exact and approximation algorithms. Some of our algorithms are linear-time fixed-parameter tractable with respect to appropriate parameters, while others are asymptotically almost optimal under the Exponential Time Hypothesis (ETH).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2018

Temporal Vertex Cover with a Sliding Time Window

Modern, inherently dynamic systems are usually characterized by a networ...
research
04/19/2019

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem

A k-edge-coloring of a graph is an assignment of colors {1,...,k} to edg...
research
11/12/2017

Dynamic Algorithms for Graph Coloring

We design fast dynamic algorithms for proper vertex and edge colorings i...
research
05/02/2023

Streaming Edge Coloring with Asymptotically Optimal Colors

Given a graph G, an edge-coloring is an assignment of colors to edges of...
research
01/29/2022

New results on the robust coloring problem

Many variations of the classical graph coloring model have been intensiv...
research
11/17/2021

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

We consider the algorithmic complexity of recognizing bipartite temporal...
research
09/15/2020

Scatterplot Selection Applying a Graph Coloring Problem

Scatterplot selection is an effective approach to represent essential po...

Please sign up or login with your details

Forgot password? Click here to reset