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 parallel algorithms for computing all pair shortest paths in directed graphs. Ouralgorithm has time complexity O(f(n)=p + I(n) log n) on the PRAM using p processors,where I(n) is log n on the EREW PRAM, log log n on the CRCW PRAM, f(n) is o(n).On the randomized CRCW PRAM we are able to achieve time complexity O(n=p + log n)using p processors.

Efficient parallel algorithms for computing all pair shortest paths in directed graphs