Optimally fast shortest path algorithms for some classes of graphs

Etsuro Moriya*, Keiko Tsugane

*この研究の対応する著者

    研究成果: Article査読

    抄録

    Two algorithms for shortest path problems are presented. One is to find the all-pairs shortest paths (APSP) that runs in O(n2Iogn + nm) time for n-vertex m-edge directed graphs consisting of strongly connected components with O(Iogn) edges among them. The other is to find the single-source shortest paths (SSSP) that runs in O(n) time for graphs reducible to the trivial graph by some simple transformations. These algorithms are optimally fast for some special classes of graphs in the sense that the former achieves O(n2) which is a lower bound of the time necessary to find APSP, and that the latter achieves O(n) which is a lower bound of the time necessary to find SSSP. The latter can be used to find APSP, also achieving the running time O(n2).

    本文言語English
    ページ(範囲)297-317
    ページ数21
    ジャーナルInternational Journal of Computer Mathematics
    70
    2
    出版ステータスPublished - 1998

    ASJC Scopus subject areas

    • 応用数学

    フィンガープリント

    「Optimally fast shortest path algorithms for some classes of graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル