On the parameterized complexity of spanning trees with small vertex covers

Show simple item record

dc.contributor.author Kaur, Chamanvir
dc.contributor.author Misra, Neeldhara
dc.contributor.other Conference on Algorithms and Discrete Applied Mathematics ((CALDAM - 2020)
dc.coverage.spatial Hyderabad, IN
dc.date.accessioned 2020-03-12T08:51:47Z
dc.date.available 2020-03-12T08:51:47Z
dc.date.issued 13-02-20
dc.identifier.citation Kaur, Chamanvir and Misra, Neeldhara, "On the parameterized complexity of spanning trees with small vertex covers", in the Conference on Algorithms and Discrete Applied Mathematics ((CALDAM - 2020), Hyderabad, IN, Feb. 13-15, 2020. en_US
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/5235
dc.description.statementofresponsibility by Chamanvir Kaur and Neeldhara Misra
dc.language.iso en_US en_US
dc.title On the parameterized complexity of spanning trees with small vertex covers en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account