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 give a polynomial time algorithm that finds the maximum weight stable setin a graph that does not contain an induced path on seven vertices or a bull(the graph with vertices $a$, $b$, $c$, $d$, $e$ and edges $ab$, $bc$, $cd$,$be$, $ce$). With the same arguments with also give a polynomial algorithm forany graph that does not contain $S_{1,2,3}$ or a bull.

Maximum Weight Stable Set in ($P_7$, bull)-free graphs and ($S_{1,2,3}$, bull)-free graphs