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

Language | English (US) |
---|---|

Pages | 677-686 |

Number of pages | 10 |

Journal | Proceedings - Annual Allerton Conference on Communication, Control, and Computing |

State | Published - Jan 1 2017 |

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

**ON FINDING SEVERAL SHORTEST PATHS IN CERTAIN GRAPHS.** / Kedem, Zvi M.; Fuchs, Henry.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - ON FINDING SEVERAL SHORTEST PATHS IN CERTAIN GRAPHS.

AU - Kedem, Zvi M.

AU - Fuchs, Henry

PY - 2017/1/1

Y1 - 2017/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0019339463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019339463&partnerID=8YFLogxK

M3 - Article

SP - 677

EP - 686

JO - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

T2 - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

JF - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

ER -