Sökning: "Markus Mützell"

Hittade 1 uppsats innehållade orden Markus Mützell.

  1. 1. Max Flow Algorithms : Ford-Fulkerson, Edmond-Karp, Goldberg-TarjanComparison in regards to practical running time on different types of randomized  flow networks.

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Martin Mützell; Markus Josefsson; [2015]
    Nyckelord :;

    Sammanfattning : The original algorithm proposed by Ford and Fulkerson to solve the maximum flow problem is still in use but is far from the only alternative. This paper introduces that algorithm as well as the similar Edmond-Karp and the more modern Goldberg-Tarjan. Ford-Fulkerson uses depth-first-searches to find augmenting paths through a residual graph. LÄS MER