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 propose a new algorithm for finding the center of a graph, as well as therank of each node in the hierarchy of distances to the center. In other words,our algorithm allows to partition the graph according to nodes distance to thecenter. Moreover, the algorithm is parallelizable. We compare the performancesof our algorithm with the ones of Floyd-Warshall algorithm, which istraditionally used for these purposes. We show that, for a large variety ofgraphs, our algorithm outperforms the Floyd-Warshall algorithm.

A new algorithm for graph center computation and graph partitioning according to the distance to the center