The Complexity of Approximating the Matching Polynomial in the Complex Plane
DOI10.1145/3448645zbMath1495.68163arXiv1807.04930OpenAlexW3155374999MaRDI QIDQ5065635
Daniel Štefanković, Leslie Ann Goldberg, Andreas Galanis, Ivona Bezáková
Publication date: 22 March 2022
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.04930
Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10) 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)
Related Items
This page was built for publication: The Complexity of Approximating the Matching Polynomial in the Complex Plane