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

The method is based on the preliminary transformation of the traditionallyused matrices or adjacency lists in the graph theory into refined projectionsfree from redundant information, and their subsequent use in constructingshortest paths. Unlike adjacency matrices and lists based on enumerating binaryadjacency relations, the refined projection is based on enumerating morecomplex relations: simple paths from a given graph vertex that are shortest.The preliminary acquisition of such projections reduces the algorithmiccomplexity of applications using them and improves their volumetric andreal-time characteristics to linear ones for a pair of vertices. The class ofgraphs considered is extended to mixed graphs.

Shortest paths search method based on the projective description of unweighted mixed graphs