Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks

By Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry. International Journal of Foundations of Computer Science, 2003

383 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0be53c7b9345890cd2267059fdb259329d13bef0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. James Cheng
2. Nicola Santoro
3. Walter Quattrociocchi
4. A. Casteigts
5. Paola Flocchini
6. Silu Huang

Citations in the corpus

• Time-varying graphs and dynamic networks (2010, methodology): “The computation of transitive closures can be done efficiently by building a tree of shortest journeys for each node, using any of the algorithms in [15].”
• Path Problems in Temporal Graphs (2014, methodology): “The closest related work is [21], and we have explained in Section 3 that our path definitions are more general than theirs.”