Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

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

    New search for: Pradhan, A.
    New search for: Mahinthakumar, G.

    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

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

    New search for: Pradhan, A.
    New search for: Mahinthakumar, G.

    Access

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

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

    New search for: Pradhan, A.
    New search for: Mahinthakumar, G.

    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:

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

    Contributors:

    Pradhan, A. (author) / Mahinthakumar, G. (author)

    Published in:

    JOURNAL OF COMPUTING IN CIVIL ENGINEERING ; 27 ; 263-273

    Publication date:

    2013-01-01

    Size:

    11 pages

    ISSN:

    0887-3801

    Type of media:

    Article (Journal)

    Type of material:

    Print

    Language:

    English

    Classification:

    DDC:  624

    © 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

    Online Contents | 2013

    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

    Floyd-Warshall in Scheduling Open Networks

    Vattai, Zoltán A. | TIBKAT | 2016

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

    Abdelghany, Khaled / Hashemi, Hossein / Alnawaiseh, Ala | British Library Online Contents | 2016

    PEMILIHAN RUTE TERPENDEK DARI KAWASAN PERMUKIMAN TERBANGUN PERKOTAAN PURBALINGGA MENGGUNAKAN ALGORITMA FLOYD-WARSHALL

    Moniq Rizki Hapsari / Probo Hardini / Eva Wahyu Indriyati | DOAJ | 2018

    Free access
    Back to top