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 the first polynomial self-stabilizing algorithm for finding a$\frac23$-approximation of a maximum matching in a general graph. The previousbest known algorithm has been presented by Manne \emph{et al.}\cite{ManneMPT11} and has a sub-exponential time complexity under thedistributed adversarial daemon \cite{Coor}. Our new algorithm is an adaptationof the Manne \emph{et al.} algorithm and works under the same daemon, but witha time complexity in $O(n^3)$ moves. Moreover, our algorithm only needs onemore boolean variable than the previous one, thus as in the Manne \emph{et al.}algorithm, it only requires a constant amount of memory space (threeidentifiers and $two$ booleans per node).

Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching