A Single-exponential FPT Algorithm for the K4-MINOR COVER Problem

Kim, Eun Jung; Paul, Christophe; Philip, Geevarghese

doi:10.1016/j.jcss.2014.05.001

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Single-exponential FPT Algorithm for the K4-MINOR COVER Problem

MPS-Authors

/persons/resource/persons71823

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

External Resource

Link
(Any fulltext)

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

Kim, E. J., Paul, C., & Philip, G. (2015). A Single-exponential FPT Algorithm for the K4-MINOR COVER Problem. Journal of Computer and System Sciences, 81(1), 186-207. doi:10.1016/j.jcss.2014.05.001.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-44BF-E

Abstract

There is no abstract available