Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor 
ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020)
Computing Maximum Matchings in Temporal Graphs.
.
Abstract
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph $G$, a temporal graph is represented by assigning a set of integer time-labels to every edge $e$ of $G$, indicating the discrete time steps at which $e$ is active. We introduce and study the complexity of a natural temporal extension of the classical graph problem Maximum Matching, taking into account the dynamic nature of temporal graphs. In our problem, Maximum Temporal Matching, we are looking for the largest possible number of time-labeled edges (simply time-edges) $(e,t)$ such that no vertex is matched more than once within any time window of $\Delta$ consecutive time slots, where $\Delta \in \mathbb{N}$ is given. The requirement that a vertex cannot be matched twice in any $\Delta$-window models some necessary "recovery" period that needs to pass for an entity (vertex) after being paired up for some activity with another entity. We prove strong computational hardness results for Maximum Temporal Matching, even for elementary cases. To cope with this computational hardness, we mainly focus on fixed-parameter algorithms with respect to natural parameters, as well as on polynomial-time approximation algorithms.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Uncontrolled Keywords: | Temporal Graph, Link Stream, Temporal Line Graph, NP-hardness, APX-hardness, Approximation Algorithm, Fixed-parameter Tractability, Independent Set |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 07 Apr 2020 07:33 |
| Last Modified: | 18 Jan 2023 23:55 |
| DOI: | 10.4230/LIPIcs.STACS.2020.27 |
| Open Access URL: | https://drops.dagstuhl.de/opus/volltexte/2020/1188... |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3082240 |
Dimensions
Dimensions
