On the Parameterized Complexity of Vertex Cover and Edge Cover with 
Connectivity Constraints

Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket

doi:10.1016/j.tcs.2014.10.035

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints

MPS-Authors

/persons/resource/persons71823

Philip, Geevarghese
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Fernau, H., Fomin, F. V., Philip, G., & Saurabh, S. (2015). On the Parameterized Complexity of Vertex Cover and Edge Cover with Connectivity Constraints. Theoretical Computer Science, 565, 1-15. doi:10.1016/j.tcs.2014.10.035.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4764-F

Abstract

There is no abstract available