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

Minimal controllability problem plays an important role in the field ofnetwork control. A New concept-Minimum Perfect Critical Set (MPCS)is proposed.Four different MPCSs were found for k-distant tree graphs. Based on thisconcept of MPCS, an algorithm for finding the minimal leader set is provided.Numerical experiments show that these theories enable the algorithm to find aminimal leader set with a probability of more than 0.98. Further, some othernumerical characteristics of the minimal leader set of k-distant trees werefound.

Minimal Leader Set for Controllability of k-distant Trees