Computing Maximum Matchings in Temporal Graphs



Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020) Computing Maximum Matchings in Temporal Graphs. .

Access the full-text of this item by clicking on the Open Access link.
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: 09 Jan 2021 02:16
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