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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper we offer a metric similar to graph edit distance which measuresthe distance between two (possibly infinite)weighted graphs with finite norm(we define the norm of a graph as the sum of absolute values of its edges). Themain result is the completeness of the space. Some other analytical propertiesof this space are also investigated. The introduced metric could have someapplications in pattern recognition and face recognition methods.

A metric on the space of weighted graphs