Misra, NeeldharaKaur, ChamanvirChamanvirKaur2025-09-042025-09-042019-01-01https://d8.irins.org/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.M.Tech123456789/440