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

Contraction Hierarchies is a successful speedup-technique to Dijkstra'sseminal shortest path algorithm that has a convenient trade-off betweenpreprocessing and query times. We investigate a shared-memory parallelimplementation that uses $O(n+m)$ space for storing the graph and O(1) spacefor each core during preprocessing. The presented data structures andalgorithms consequently exploits cache locality and thus exhibit competitivepreprocessing times. The presented implementation is especially suitable forpreprocessing graphs of planet-wide scale in practice. Also, our experimentsshow that optimal data structures in the PRAM model can be beaten in practiceby exploiting memory cache hierarchies.

Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing