Parameterized complexity of perfectly matched sets

DOI10.4230/LIPICS.IPEC.2022.2MaRDI QIDQ6969011zbMATH OpenFDO

Authors Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu

Publication date 23 June 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

interval graphsparameterized complexityplanar graphs\(d\)-degenerate graphsapex-minor-free graphsperfectly matched sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Parameterized complexity of perfectly matched sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969011)