Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves

DOI10.1007/978-3-031-43587-4_28MaRDI QIDQ6546606

Emmanuel Sam, Petr A. Golovach, Benjamin Bergougnoux, Nello Blaser

Publication date: 29 May 2024

zbMATH Keywords

spanning treeparameterized complexitykernelizationDFS tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves