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. In: STACS.

Text
temporal-matching-stacs.pdf - Author Accepted Manuscript
Download (882kB) | Preview

Official URL: https://www.dagstuhl.de/dagpub/978-3-95977-140-5

Item Type:	Conference or Workshop Item (Unspecified)
Additional Information:	Source info: JCSS-D-22-00183
Uncontrolled Keywords:	Link Streams, Temporal Line Graphs, NP-hardness, APX-hardness, Approximation Algorithms, Fixed-Parameter Tractability
Depositing User:	Symplectic Admin
Date Deposited:	07 Apr 2020 07:32
Last Modified:	20 Oct 2023 11:16
DOI:	10.4230/LIPIcs.STACS.2020.27
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3082136