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

In this paper, Greedy Algorithms such as Kruskal’s, Prim’s, Boruvka’s, Reverse-delete Algorithm were applied on different types of graphs like Mobius-Kantor graph, Durer graph, Golomb graph to find the (MST).

A STUDY ON SOME NAMED GRAPHS TO FIND THE MINIMUM SPANNING TREE (MST) USING GREEDY ALGORITHMS