BIROn - Birkbeck Institutional Research Online

    Finding next-to-shortest paths in a graph

    Krasikov, I. and Noble, Steven (2004) Finding next-to-shortest paths in a graph. Information Processing Letters 92 (3), pp. 117-119. ISSN 0020-0190.

    Full text not available from this repository.

    Abstract

    We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)- paths with length strictly greater than the length of the shortest (u, v)- path. In constrast to the situation in directed graphs, where the problem has been shown to be NP-hard, providing edges of length zero are allowed, we prove the somewhat surprising result that there is a polynomial time algorithm for the undirected version of the problem.

    Metadata

    Item Type: Article
    Additional Information: https://bura.brunel.ac.uk/handle/2438/1677
    School: School of Business, Economics & Informatics > Economics, Mathematics and Statistics
    Depositing User: Sarah Hall
    Date Deposited: 20 Jul 2020 12:05
    Last Modified: 20 Jul 2020 12:05
    URI: https://eprints.bbk.ac.uk/id/eprint/32601

    Statistics

    Downloads
    Activity Overview
    0Downloads
    40Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item