An Improved Index Based on MapReduce for Path Queries in Public Transportation Networks

Ning, Zhiqing; Dai, Genan; Liu, Yubao; Ge, Youming; Wu, Jiefeng

doi:10.1109/fskd.2018.8687194

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distributed algorithms for finding shortest paths are developed in [34][35][36], and surveys of the general area of temporal graphs appear in [37][38][39].…”

Section: Related Workmentioning

confidence: 99%

Path Algorithms for Contact Sequence Temporal Graphs

Gheibi,

Banerjee,

Ranka

et al. 2024

Algorithms

View full text Add to dashboard Cite

This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems.

show abstract

“…Distributed algorithms for finding shortest paths are developed in [34][35][36], and surveys of the general area of temporal graphs appear in [37][38][39].…”

Section: Related Workmentioning

confidence: 99%