XNLP-completeness for parameterized problems on graphs with a linear structure

DOI10.4230/LIPICS.IPEC.2022.8MaRDI QIDQ6969004zbMATH OpenFDO

Authors Hans L. Bodlaender, Carla Groenland, H. Jacob, Lars Jaffke, Paloma T. Lima

Publication date 23 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://dspace.library.uu.nl/handle/1874/425595

zbMATH Keywords

bandwidthpathwidthparameterized complexitylinear clique-widthW-hierarchyXNLPlinear mim-width

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: XNLP-completeness for parameterized problems on graphs with a linear structure

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