Computing and Listing st-Paths in Public Transportation Networks-Reference-Cited by-同舟云学术

Computing and Listing st-Paths in Public Transportation Networks

Published:2016 Issue: Volume: Page:102-116
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Böhmová Kateřina,Mihalák Matúš,Pröger Tobias,Sacomoto Gustavo,Sagot Marie-France

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-34171-2_8

Reference20 articles.

1. Bast, H., Delling, D., Goldberg, A.V., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. CoRR abs/1504.05140 (2015)

2. Bezem, G., Leeuwen, J.V.: Enumeration in graphs. Technical report RUU-CS-87-07, Utrecht University (1987)

3. Birmelé, E., Ferreira, R.A., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal listing of cycles and st-paths in undirected graphs. In: SODA 2013, pp. 1884–1896 (2013)

4. Böhmová, K., Mihalák, M., Neubert, P., Pröger, T., Widmayer, P.: Robust routing in urban public transportation: evaluating strategies that learn from the past. In: ATMOS 2015, pp. 68–81 (2015)

5. Böhmová, K., Mihalák, M., Pröger, T., Šrámek, R., Widmayer, P.: Robust routing in urban public transportation: how to find reliable journeys based on past observations. In: ATMOS 2013, pp. 27–41 (2013)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sequence Hypergraphs: Paths, Flows, and Cuts;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018

2. Computing and Listing st-Paths in Public Transportation Networks;Theory of Computing Systems;2017-01-11

3. Sequence Hypergraphs;Graph-Theoretic Concepts in Computer Science;2016