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

In this paper we show how to solve the \emph{Maximum Weight Stable SetProblem} in a claw-free graph $G(V, E)$ with $\alpha(G) \le 3$ in time ${\calO}(|E|\log|V|)$. More precisely, in time ${\cal O}(|E|)$ we check whether$\alpha(G) \le 3$ or produce a stable set with cardinality at least $4$;moreover, if $\alpha(G) \le 3$ we produce in time ${\cal O}(|E|\log|V|)$ amaximum stable set of $G$. This improves the bound of ${\cal O}(|E||V|)$ due toFaenza et al.

An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $\alpha({G}) \le 3$