Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020)
Computing Maximum Matchings in Temporal Graphs.
.
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: | 23 Jul 2022 16:10 |
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
Altmetric
Share
CORE (COnnecting REpositories)