On the complexity of finding large odd induced subgraphs and odd colorings
From MaRDI portal
Publication:5918338
DOI10.1007/s00453-021-00830-xMaRDI QIDQ5918338
Publication date: 26 July 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.06078
parameterized complexity; exponential time hypothesis; odd subgraph; rank-width; odd coloring; single-exponential algorithm