English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In the 3-path vertex cover problem, the input is an undirected graph $G$ andan integer $k$. The goal is to decide whether there is a set of vertices $S$ ofsize at most $k$ such that every path with 3 vertices in $G$ contains at leastone vertex of $S$. In this paper we give parameterized algorithm for 3-pathcover whose time complexity is $O^*(1.713^k)$. Our algorithm is faster thanprevious algorithms for this problem.

Parameterized algorithm for 3-path vertex cover