𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for the All Pairs Suffix-Prefix Problem

✍ Scribed by Dan Gusfield; Gad M. Landau; Baruch Schieber

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
385 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simpleO(n2) algorithm for the all-pair
A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph
✍ Mirchandani, Prakash πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 288 KB πŸ‘ 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a

An Efficient Algorithm for the Complex R
An Efficient Algorithm for the Complex Roots Problem
✍ C.Andrew Neff; John H. Reif πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ΟͺȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l