On the parameterized complexity of spanning trees with small vertex covers

Source
Indian Institute of Technology, Gandhinagar
Date Issued
2019-01-01
Author(s)
Kaur, Chamanvir
URI
Subjects
17210030
Computer Science and Engineering
Minimum Power Spanning Tree
Vertex Cover
FPT Algorithm
Kernelization
Polynomial Kernel
17210030
Computer Science and Engineering
Minimum Power Spanning Tree
Vertex Cover
FPT Algorithm
Kernelization
Polynomial Kernel