Scribd Logo
Upload

Welcome to Scribd!

  • Tài Liệu Tham Khảo Bellman - Ford

    Uploaded by

    ky.lamthai
    7 views1 page
    This document discusses algorithms for finding the shortest path in a graph, specifically the Bellman-Ford algorithm. It provides references to books and papers on graph theory, network flow theory, and the original 1958 paper by Bellman describing the routing problem the algorithm aims to solve. It also lists Wikipedia pages in English and Vietnamese providing more information on the Bellman-Ford algorithm.

    Original Description:

    Original Title

    Tài Liệu Tham Khảo Bellman--Ford

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses algorithms for finding the shortest path in a graph, specifically the Bellman-Ford algorithm. It provides references to books and papers on graph theory, network flow theory, and the original 1958 paper by Bellman describing the routing problem the algorithm aims to solve. It also lists Wikipedia pages in English and Vietnamese providing more information on the Bellman-Ford algorithm.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    7 views1 page

    Tài Liệu Tham Khảo Bellman - Ford

    Uploaded by

    ky.lamthai
    This document discusses algorithms for finding the shortest path in a graph, specifically the Bellman-Ford algorithm. It provides references to books and papers on graph theory, network flow theory, and the original 1958 paper by Bellman describing the routing problem the algorithm aims to solve. It also lists Wikipedia pages in English and Vietnamese providing more information on the Bellman-Ford algorithm.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    https://vnoi.info/wiki/algo/graph-theory/shortest-path.

    md

    https://www.giaithuatlaptrinh.com/?p=789

    https://howkteam.vn/course/cau-truc-du-lieu-va-giai-thuat/tim-kiem-duong-di-ngan-
    nhat-tren-do-thi-bellman-ford-4389

    [1] Trần Đan Thư – Dương Anh Đức, Lý thuyết đồ thị, NXB Đại học quốc gia Tp.HCM,
    2006.
    [1] Bellman, Richard. On a routing problem. Quarterly of Applied Mathematics 16:
    87–90, 1958.
    [2] Ford Jr., Lester R. Network Flow Theory. Paper P-923. Santa Monica, California:
    RAND Corporation, 1956.
    [3] Bannister, M. J.; Eppstein, D. Randomized speedup of the Bellman–Ford
    algorithm. Analytic Algorithmics and Combinatorics (ANALCO12), Kyoto, Japan. pp.
    41–47, 2012.
    [4] https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
    [5] https://vi.wikipedia.org/wiki/Thu%E1%BA%ADt_to%C3%A1n_Bellman%E2%80%93Ford

    You might also like