A Fast Parameterized Algorithm for Co-Path Set

DOI10.4230/LIPIcs.IPEC.2016.28zbMath1398.90197arXiv1603.04376OpenAlexW2964119297MaRDI QIDQ4634414

Andrew van der Poel, Blair D. Sullivan

Publication date: 10 April 2018

Full work available at URL: https://arxiv.org/abs/1603.04376

zbMATH Keywords

treewidthparameterized complexityco-path setfixed-parameter tractable complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (1)

Faster deterministic algorithm for \textsc{Co-Path Set}

This page was built for publication: A Fast Parameterized Algorithm for Co-Path Set