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

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk on that graph. It has been known that this problem is solvable in O(nlog⁡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.

Original languageEnglish
JournalTheoretical Computer Science
DOIs
Publication statusAccepted/In press - 2019 Jan 1

Keywords

  • Graph inference
  • Palindrome
  • String rewriting

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Linear-time online algorithm for inferring the shortest path graph from a walk label'. Together they form a unique fingerprint.

Cite this