An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. The $VCP_t$ problem is NP-complete for any integer $t\g...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
2019-11-01
|
| Edice: | Discrete Mathematics & Theoretical Computer Science |
| Témata: | |
| On-line přístup: | https://dmtcs.episciences.org/1425/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|