On short fastest paths in temporal graphs

Publikationstyp

Conference Paper

Date Issued

2021

Sprache

English

Author(s)

Danda, Umesh Sandeep

Ramakrishna, G.

Schmidt, Jens M.

Institut

Algorithmen und Komplexität E-11

TORE-URI

http://hdl.handle.net/11420/8390

Citation

15th International Conference and Workshops on Algorithms and Computation, WALCOM 2021

Contribution to Conference

15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021)

Publisher DOI

10.1007/978-3-030-68211-8_4

Scopus ID

2-s2.0-85102747948

ISBN of container

978-3-030-68211-8