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 WIS paper, we present NC algorithms for finding minimum weight independent dominating set (MWIDS), minimum weight total dominating set (MWTDS), and minimum weight connected dominating set (MWCDS) for pemnutation grapha. All these algorithms take O (log 2n) time on CREW PRAM. The number of processors required is n3/logn for finding MWIDS, and mWogrn for tinding MWTDS and MWCDS, wheze m is the number of edges in a permutation graph of n nodes.

NC algorithms for dominations in permutation graphs