Computing maximum matchings in temporal graphs

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 c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences Jg. 137; S. 1 - 19
Hauptverfasser: Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor, Zschoche, Philipp
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.11.2023
Schlagworte:
Approximation algorithms
APX-hardness
Fixed-Parameter tractability
Independent set
Kernelization
Link streams
NP-hardness
Temporal line graphs
Link streams
NP-hardness
Temporal line graphs
Fixed-Parameter tractability
Approximation algorithms
Independent set
APX-hardness
Kernelization
ISSN:0022-0000, 1090-2724
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 Δ consecutive time slots, where Δ∈N is given. We prove strong computational hardness results for Maximum Temporal Matching, even for elementary cases, as well as fixed-parameter algorithms with respect to natural parameters and polynomial-time approximation algorithms.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2023.04.005