Parallel Contraction Hierarchies Can Be Efficient and Scalable

Wan, Zijin; Dong, Xiaojun; Wang, Letong; Zhu, Enzuo; Gu, Yan; Sun, Yihan

doi:10.1145/3721145.3725744

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 7:00 AM ET to 7:30 AM ET on Friday, April 24 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.

+ Advanced Search

Citation Details

Parallel Contraction Hierarchies Can Be Efficient and Scalable

Award ID(s):: 2103483 2238358 2227669

PAR ID:: 10638003

Author(s) / Creator(s):: Wan, Zijin; Dong, Xiaojun; Wang, Letong; Zhu, Enzuo; Gu, Yan; Sun, Yihan

Publisher / Repository:: ACM

Date Published:: 2025-06-08

Page Range / eLocation ID:: 670 to 688

Subject(s) / Keyword(s):: contraction hierarchy, parallell algorithms

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
https://doi.org/10.1145/3721145.3725744

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this