Linear-Time Online Algorithm Inferring the Shortest Path from a Walk

被引：1
|
作者：
Narisada, Shintaro [1 ]
Hendrian, Diptarama [1 ]
Yoshinaka, Ryo [1 ]
Shinohara, Ayumi [1 ]
机构：
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi, Japan
来源：
STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2018 | 2018年 / 11147卷
关键词：
Graph inference; Walk; Palindrome; GRAPH;
D O I：
10.1007/978-3-030-00479-8_25
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：311 / 324
页数：14
相关论文
共 50 条
12345