Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Computing maximum matchings in temporal graphs
Mertzios, G.B.; Molter, H.; Niedermeier, R.; Zamaraev, V.; Zschoche, P.
Authors
H. Molter
R. Niedermeier
V. Zamaraev
P. Zschoche
Contributors
Christophe Paul
Editor
Markus Blaser
Editor
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 Δ consecutive time slots, where Δ ∈ ℕ is given. The requirement that a vertex cannot be matched twice in any Δ-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.
Citation
Mertzios, G., Molter, H., Niedermeier, R., Zamaraev, V., & Zschoche, P. (2020). Computing maximum matchings in temporal graphs. In C. Paul, & M. Blaser (Eds.), 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (27:1-27:14). https://doi.org/10.4230/lipics.stacs.2020.27
Conference Name | 37th International Symposium on Theoretical Aspects of Computer Science (STACS) |
---|---|
Conference Location | Montpellier, France |
Acceptance Date | Dec 19, 2019 |
Online Publication Date | Mar 4, 2020 |
Publication Date | Mar 1, 2020 |
Deposit Date | Dec 23, 2019 |
Publicly Available Date | Jun 12, 2020 |
Pages | 27:1-27:14 |
Series Title | Leibniz International Proceedings in Informatics (LIPIcs) |
Series Number | 154 |
Series ISSN | 1868-8969 |
Book Title | 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) |
DOI | https://doi.org/10.4230/lipics.stacs.2020.27 |
Public URL | https://durham-repository.worktribe.com/output/1141315 |
Related Public URLs | https://arxiv.org/pdf/1905.05304.pdf |
Files
Published Conference Proceeding
(590 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
© George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche; licensed under Creative Commons License CC-BY.
You might also like
Graphs with minimum fractional domatic number
(2023)
Journal Article
Approximate and Randomized algorithms for Computing a Second Hamiltonian Cycle
(2023)
Journal Article
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs
(2023)
Conference Proceeding
Fast parameterized preprocessing for polynomial-time solvable graph problems
(2023)
Journal Article
The complexity of computing optimum labelings for temporal connectivity
(2022)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search