Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
Shintaro Narisada|Diptarama Hendrian|Ryo Yoshinaka|Ayumi Shinohara
| Anthology ID: | DBLP:conf/spire/NarisadaHYS18 |
|---|---|
| Volume: | String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings |
| Year: | 2018 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 311-324 |
| URL: | https://doi.org/10.1007/978-3-030-00479-8_25 |
| DOI: | https://doi.org/10.1007/978-3-030-00479-8_25 |
| DBLP: | conf/spire/NarisadaHYS18 |
| BibTeX: |
@inproceedings{narisada-2018-lineartime,
author = {Shintaro Narisada and
Diptarama Hendrian and
Ryo Yoshinaka and
Ayumi Shinohara},
editor = {Travis Gagie and
Alistair Moffat and
Gonzalo Navarro and
Ernesto Cuadros-Vargas},
title = {{Linear-Time Online Algorithm Inferring the Shortest Path from a Walk}},
booktitle = {{String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {11147},
pages = {311--324},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00479-8_25},
doi = {https://doi.org/10.1007/978-3-030-00479-8_25}
}