Linear-time online algorithm inferring the shortest path from a walk

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk of that graph. It has been known that this problem is solvable in O(n log n) time when the targets are path or cycle graphs. This paper presents an online algorithm for the problem of this restricted case that runs in O(n) time, based on Manacher’s algorithm for computing all the maximal palindromes in a string.

本文言語English
ホスト出版物のタイトルString Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings
編集者Travis Gagie, Alistair Moffat, Gonzalo Navarro, Ernesto Cuadros-Vargas
出版社Springer Verlag
ページ311-324
ページ数14
ISBN(印刷版)9783030004781
DOI
出版ステータスPublished - 2018
イベント25th International Symposium on String Processing and Information Retrieval, SPIRE 2018 - Lima, Peru
継続期間: 2018 10 92018 10 11

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11147 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other25th International Symposium on String Processing and Information Retrieval, SPIRE 2018
国/地域Peru
CityLima
Period18/10/918/10/11

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Linear-time online algorithm inferring the shortest path from a walk」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル