Path Problems in Temporal Graphs

  title={Path Problems in Temporal Graphs},
  author={Huanhuan Wu and James Cheng and Silu Huang and Yiping Ke and Yi Lu and Yanyan Xu},
Shortest path is a fundamental graph problem with numerous a pplications. However, the concept of classic shortest path i s insufficient or even flawed in a temporal graph, as the temporal info rmation determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various concepts of “shortest” path f or temporal graphs. Computing these temporal paths is challengin g as subpaths of a “shortest” path may not be… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-10 of 38 extracted citations

Parallel Algorithm for Single-Source Earliest-Arrival Problem in Temporal Graphs

2017 46th International Conference on Parallel Processing (ICPP) • 2017
View 9 Excerpts
Highly Influenced

Evolving Centralities in Temporal Graphs: A Twitter Network Analysis

2016 17th IEEE International Conference on Mobile Data Management (MDM) • 2016
View 7 Excerpts
Highly Influenced

Fast Computation of Dense Temporal Subgraphs

2017 IEEE 33rd International Conference on Data Engineering (ICDE) • 2017
View 4 Excerpts
Highly Influenced

ATMoN: Adapting the "Temporality" in Large-Scale Dynamic Networks

2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) • 2018
View 2 Excerpts

64 Citations

Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 28 references

Path prob lems in temporal graphs (preliminary version)

H. Wu, J. Cheng, +3 authors Y. Xu ̃ hhwu/temsp.pdf • 2013
View 4 Excerpts
Highly Influenced

Computing shor test

B.-M.B. Xuan, A. Ferreira, A. Jarry
fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci., 14(2):267–285 • 2003
View 7 Excerpts
Highly Influenced

and N

A. Casteigts, P. Flocchini, W. Quattrociocchi
Sa ntoro. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems , 27(5):387–408 • 2012
View 4 Excerpts
Highly Influenced

Efficien t processing of k-hop reachability queries

J. Cheng, Z. Shang, H. Cheng, H. Wang, J. X. Yu
VLDB J., 23(2):227–252 • 2014
View 1 Excerpt

and R

A.W.-C. Fu, H. Wu, J. Cheng
C.-W. Wong. Is-label: a n independent-set based labeling scheme for point-to-point distance querying.PVLDB, 6(6):457–468 • 2013
View 1 Excerpt

K - reach : W o is in your small world

H. Wang, J. X. Yu.
PVLDB • 2012

Similar Papers

Loading similar papers…