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

Shintaro Narisada; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara

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

Data Structures and Algorithms 2019-02-22 v3

Authors: Shintaro Narisada , Diptarama Hendrian , Ryo Yoshinaka , Ayumi Shinohara

Abstract

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.

Keywords

graph algorithm shortest path problem random walks on graphs

Cite

@article{arxiv.1806.09806,
  title  = {Linear-Time Online Algorithm Inferring the Shortest Path from a Walk},
  author = {Shintaro Narisada and Diptarama Hendrian and Ryo Yoshinaka and Ayumi Shinohara},
  journal= {arXiv preprint arXiv:1806.09806},
  year   = {2019}
}

Comments

31 pages, 7 figures, extended version of the proceeding paper in SPIRE 2018

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

Abstract

Keywords

Cite

Comments

Related papers