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

Finding the shortest path distance between an arbitrary pair of vertices is afundamental problem in graph theory. A tremendous amount of research has beensuccessfully attempted on this problem, most of which is limited to staticgraphs. Due to the dynamic nature of real-world networks, there is a pressingneed to address this problem for dynamic networks undergoing changes. In thispaper, we propose an \emph{online incremental} method to efficiently answerdistance queries over very large dynamic graphs. Our proposed methodincorporates incremental update operations, i.e. edge and vertex additions,into a highly scalable framework of answering distance queries. Wetheoretically prove the correctness of our method and the preservation oflabelling minimality. We have also conducted extensive experiments on 12 largereal-world networks to empirically verify the efficiency, scalability, androbustness of our method.

Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs