Most classic problems remain NP-hard on relative neighborhood graphs and their relatives

DOI10.4230/LIPICS.SWAT.2022.29MaRDI QIDQ6544087zbMATH OpenFDO

Authors Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2022.29

zbMATH Keywords

3-colorabilitydominating setexponential-time hypothesisfeedback vertex setgabriel graphsHamiltonian cycleindependent setproximity graphsrelatively closest graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Most classic problems remain NP-hard on relative neighborhood graphs and their relatives

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