On the parameterized complexity of spanning trees with small vertex covers

Misra, NeeldharaKaur, ChamanvirChamanvirKaur2025-09-042025-09-042019-01-01http://repository.iitgn.ac.in/handle/IITG2025/31956ill.; 30 cm.17210030Computer Science and EngineeringMinimum Power Spanning TreeVertex CoverFPT AlgorithmKernelizationPolynomial Kernel17210030Computer Science and EngineeringMinimum Power Spanning TreeVertex CoverFPT AlgorithmKernelizationPolynomial KernelOn the parameterized complexity of spanning trees with small vertex coversM.Tech35p.123456789/440