Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

    Parallel All-Pairs Shortest Path Algorithm: Network-Decomposition Approach

    New search for: Abdelghany, Khaled
    New search for: Hashemi, Hossein
    New search for: Alnawaiseh, Ala

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Parallel All-Pairs Shortest Path Algorithm: Network-Decomposition Approach

    New search for: Abdelghany, Khaled
    New search for: Hashemi, Hossein
    New search for: Alnawaiseh, Ala

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Parallel All-Pairs Shortest Path Algorithm: Network-Decomposition Approach

    New search for: Abdelghany, Khaled
    New search for: Hashemi, Hossein
    New search for: Alnawaiseh, Ala

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Document information
    Title:

    Parallel All-Pairs Shortest Path Algorithm: Network-Decomposition Approach

    Contributors:

    Abdelghany, Khaled (author) / Hashemi, Hossein (author) / Alnawaiseh, Ala (author)

    Published in:

    Transportation research record ; 2567 ; 95-104

    Publication date:

    2016-01-01

    Size:

    10 pages

    ISSN:

    0361-1981

    Type of media:

    Article (Journal)

    Type of material:

    Print

    Language:

    English

    Classification:

    DDC:  388.072

    © Metadata Copyright the British Library Board and other contributors. All rights reserved.

    Similar titles

    Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

    Pradhan, Anu / Mahinthakumar, G. (Kumar) | ASCE | 2012

    Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

    Online Contents | 2013

    Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms

    Pradhan, A. / Mahinthakumar, G. | British Library Online Contents | 2013

    The Shortest Path Algorithm Based on Hierarchical Road Network

    Gangwu, Jiang / Jing, Wang / Bo, Chen | IEEE | 2006

    Shortest viable path algorithm in multimodal networks

    Lozano, Angelica | Online Contents | 2001

    Back to top