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 study the problem of point-to-point distance querying for massivescale-free graphs, which is important for numerous applications. Given adirected or undirected graph, we propose to build an index for answering suchqueries based on a hop-doubling labeling technique. We derive bounds on theindex size, the computation costs and I/O costs based on the properties ofunweighted scale-free graphs. We show that our method is much more efficientcompared to the state-of-the-art technique, in terms of both querying time andindexing time. Our empirical study shows that our method can handle graphs thatare orders of magnitude larger than existing methods.

Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks