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

Many applications, ranging from natural to social sciences, rely on graphletanalysis for the intuitive and meaningful characterization of networksemploying micro-level structures as building blocks. However, it has not beenthoroughly explored in heterogeneous graphs, which comprise various types ofnodes and edges. Finding graphlets and orbits for heterogeneous graphs isdifficult because of the heterogeneity and abundance of semantic information.We consider heterogeneous graphs, which can be treated as colored graphs. Byapplying the canonical label technique, we determine the graph isomorphismproblem with multiple states on nodes and edges. With minimal parameters, webuild all non-isomorphic graphs and associated orbits. We provide a Pythonpackage that can be used to generate orbits for colored directed graphs anddetermine the frequency of orbit occurrence. Finally, we provide four examplesto illustrate the use of the Python package.

Graphlet and Orbit Computation on Heterogeneous Graphs