New lower bounds and upper bounds for listing avoidable vertices

DOI10.4230/LIPICS.MFCS.2022.41MaRDI QIDQ6584038zbMATH OpenFDO

Authors Mingyang Deng, Williams Virginia Vassilevska, Ziqian Zhong

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.41

zbMATH Keywords

avoidable vertexfine-grained complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: New lower bounds and upper bounds for listing avoidable vertices

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