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
Subjects
Minimum Power Spanning Tree
Vertex Cover
FPT Algorithm
Kernelization
Polynomial Kernel
Minimum Power Spanning Tree
Vertex Cover
FPT Algorithm
Kernelization
Polynomial Kernel
File(s)
