On the parameterized complexity of the acyclic matching problem
From MaRDI portal
Publication:6038700
DOI10.1016/j.tcs.2023.113862arXiv2109.06004MaRDI QIDQ6038700
Publication date: 2 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.06004
computational complexity; treewidth; induced matching; parameterized complexity; acyclic matching; modular-width
68Qxx: Theory of computing