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 propose a new algorithm MARINLINGA for reverse line graph computation,i.e., constructing the original graph from a given line graph. Based on thecompletely new and simpler principle of link relabeling and endnoderecognition, MARINLINGA does not rely on Whitney's theorem while all previousalgorithms do. MARINLINGA has a worst case complexity of O(N^2), where Ndenotes the number of nodes of the line graph. We demonstrate that MARINLINGAis more time-efficient compared to Roussopoulos's algorithm, which iswell-known for its efficiency.

Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm