ON FINDING SEVERAL SHORTEST PATHS IN CERTAIN GRAPHS.

Zvi M. Kedem, Henry Fuchs

Research output: Contribution to conferencePaper

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 languageEnglish (US)
Pages677-686
Number of pages10
StatePublished - Jan 1 2017
EventProc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA
Duration: Oct 8 1980Oct 11 1980

Other

OtherProc Annu Allerton Conf Commun Control Comput 18th
CityMonticello, IL, USA
Period10/8/8010/11/80

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kedem, Z. M., & Fuchs, H. (2017). ON FINDING SEVERAL SHORTEST PATHS IN CERTAIN GRAPHS.. 677-686. Paper presented at Proc Annu Allerton Conf Commun Control Comput 18th, Monticello, IL, USA, .