Parameterized complexity of perfectly matched sets
From MaRDI portal
Publication:6038698
DOI10.1016/j.tcs.2023.113861MaRDI QIDQ6038698
Abhishek Sahu, Satyabrata Jana, Akanksha Agrawal, Sutanay Bhattacharjee
Publication date: 2 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
planar graphs; interval graphs; parameterized complexity; \(d\)-degenerate graphs; apex-minor-free graphs; perfectly matched sets
68Qxx: Theory of computing