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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

An algorithm, complete with a spec ific FORTRAN implementation, is presented for the problem of determining whether or not two undirec tr d graphs are isomorphic. The algorithm, centered upon the eigenvalues and eigenvectors of a modified adjacency matrix and techniques for decreasing the size of the automorphism group, is quite different from others (mos t of which are comhinatorially based) and tends to work relatively very quickly on difficult tes t cases as well as on typical exa mples. Complexity estimates are given for many eventualities.

An efficient linear algebraic algorithm for the determination of isomorphism in pairs of undirected graphs