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

06/26/2018
by   Shintaro Narisada, et al.
0

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 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/30/2019

Computing runs on a trie

A maximal repeat, or run, in a string, is a periodically maximal substri...
05/27/2021

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

In static graphs, the betweenness centrality of a graph vertex measures ...
06/10/2019

A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs

Finding a shortest path or cycle in graphs is a fundamental problem. In ...
01/28/2022

The Complexity of Approximate Pattern Matching on De Bruijn Graphs

Aligning a sequence to a walk in a labeled graph is a problem of fundame...
11/03/2013

An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs

This paper presents an adaptive amoeba algorithm to address the shortest...
06/26/2020

Computing all s-t bridges and articulation points simplified

Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
08/08/2018

A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time

In this paper we present a new algorithm called Raffica algorithm for Si...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.