Inview of its practical applications to traffic engineering, attention is given to shortest chain problem; negative lengths are admitted, provided that there is no "negative" cycle; algorithm is presented to find shortest chain in graph given. (47137)


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    K shortest chains in graph


    Additional title:

    Transp Res


    Contributors:

    Published in:

    Publication date :

    1968


    Size :

    11 pages



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    The k shortest chains in a graph

    Sakarovitch, M. | Elsevier | 1967


    A Shortest Path Algorithm Based on Hierarchical Graph Model

    Wu, Y. / Xu, J. / Hu, Y. et al. | British Library Conference Proceedings | 2003


    A shortest path algorithm based on hierarchical graph model

    Wu Yimin, / Xu Jianmin, / Hu Yucong, et al. | IEEE | 2003



    Shortest Spheroidal Distance

    Zukas, T. | Online Contents | 1994