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/

Zendy Plus

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

Zendy Tools

Zendy Open

We show how to test whether a graph with n vertices and m edges is a partialcube, and if so how to find a distance-preserving embedding of the graph into ahypercube, in the near-optimal time bound O(n^2), improving previous O(nm)-timesolutions.

Recognizing Partial Cubes in Quadratic Time