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 develop the methodology of positioning graph vertices relative to eachother to solve the problem of determining isomorphism of two undirected graphs.Based on the position of the vertex in one of the graphs, it is determined thecorresponding vertex in the other graph.  For the selected vertex of the undirected graph, we define the neighborhoodsof the vertices. Next, we construct the auxiliary directed graph, spawned bythe selected vertex. The vertices of the digraph are positioned by specialcharacteristics --- vectors, which locate each vertex of the digraph relativethe found neighborhoods.  This enabled to develop the algorithm for determining graph isomorphism, theruning time of which is equal to $O(n^4)$.

Polynomial-time algorithm for determining the graph isomorphism (v.2)