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

@inproceedings{Narisada2018LinearTimeOA,
title={Linear-Time Online Algorithm Inferring the Shortest Path from a Walk},
author={Shintaro Narisada and Diptarama Hendrian and Ryo Yoshinaka and Ayumi Shinohara},
booktitle={SPIRE},
year={2018}
}
• Shintaro Narisada, +1 author Ayumi Shinohara
• Published in SPIRE 2018
• Computer Science, Mathematics
• 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 $$\mathrm {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 $$\mathrm {O}(n)$$ time, based on Manacher’s algorithm for computing all the maximal palindromes in a string.

#### References

##### Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

## Inferring a Tree from Walks

• Mathematics, Computer Science
• Theor. Comput. Sci.
• 1996
VIEW 2 EXCERPTS

## Inferring a Graph from Path Frequency

• Mathematics, Computer Science
• CPM
• 2005
VIEW 2 EXCERPTS

## Inferring graphs from walks

• Computer Science
• COLT '90
• 1990
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

## Bounded degree graph inference from walks

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

## Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete

• Mathematics, Computer Science
• MFCS
• 1994
VIEW 3 EXCERPTS

## A New Linear-Time On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL