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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Given a set of paths $P$ we define the \emph{Path Covering with ForestNumber} of $P$} (PCFN($P$)) as the minimum size of a set $F$ of forestssatisfying that every path in $P$ is contained in at least one forest in $F$.We show that PCFN($P$) is treatable when $P$ is a set of non-crossing shortestpaths in a plane graph or subclasses. We prove that if $P$ is a set ofnon-crossing shortest paths of a planar graph $G$ whose extremal vertices lieon the same face of $G$, then PCFN($P$)\leq 4$, and this bound is tight.

Non-Crossing Shortest Paths are Covered with Exactly Four Forests