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

We present a polynomial-time algorithm that finds a maximum weight stable setin a graph that does not contain as an induced subgraph an induced path on sixvertices or a bull (the graph with vertices $a, b, c, d, e$ and edges $ab, bc,cd, be, ce$).

The maximum weight stable set problem in $(P_6,\mbox{bull})$-free graphs