Abstract
Given a graph, the problem of finding shortest paths from u//1**(**i**) to u//2**(**1**) for a set of pairs of vertices left brace (u//1**(**i**), u//2**(**i**)) vertical i equals 1,. . . ,m right brace is considered. A fast algorithm for a special class of problems is presented. The algorithm is applied to the circular string-to-string correction problem. 3 efs.
| Original language | English (US) |
|---|---|
| Pages | 677-686 |
| Number of pages | 10 |
| State | Published - 1981 |
| Event | Proc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA Duration: Oct 8 1980 → Oct 11 1980 |
Other
| Other | Proc Annu Allerton Conf Commun Control Comput 18th |
|---|---|
| City | Monticello, IL, USA |
| Period | 10/8/80 → 10/11/80 |
ASJC Scopus subject areas
- Engineering(all)