The precise complexity of finding rainbow even matchings

DOI10.1007/978-3-030-21363-3_16zbMath1434.68189OpenAlexW2952320773MaRDI QIDQ2175422

Martin Loebl

Publication date: 29 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-21363-3_16

zbMATH Keywords

matchingexponential time hypothesisIsing partition functionMax-Cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The precise complexity of finding rainbow even matchings