ON FINDING SEVERAL SHORTEST PATHS IN CERTAIN GRAPHS.

Zvi M. Kedem, Henry Fuchs

Research output: Research - peer-reviewArticle

  • 5 Citations

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.

LanguageEnglish (US)
Pages677-686
Number of pages10
JournalProceedings - Annual Allerton Conference on Communication, Control, and Computing
StatePublished - Jan 1 2017

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

In: Proceedings - Annual Allerton Conference on Communication, Control, and Computing, 01.01.2017, p. 677-686.

Research output: Research - peer-reviewArticle

@article{2f9df365204d469e9a4641c65a7966cb,
title = "ON FINDING SEVERAL SHORTEST PATHS IN CERTAIN GRAPHS.",
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.",
author = "Kedem, {Zvi M.} and Henry Fuchs",
year = "2017",
month = "1",
pages = "677--686",
journal = "Proceedings - Annual Allerton Conference on Communication, Control, and Computing",

}

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 -