An efficient polynomial time algorithm for solving maximum flow problems in directed networks has been proposed in this paper. The algorithm is basically based on successive divisions of capacities by multiples of two; it solves the maximum flow problem as a sequence of O(m) shortest path problems on residual networks with n nodes and m arcs. It runs in O(m2 r) time, where r is the smallest integer greater than or equal to log B, and B is the largest arc capacity of the network. A numerical example has been illustrated using this proposed algorithm.
Bibliografsko gradivo je bilo uspešno dodano na polico.
Dodajanje bibliografskega gradiva na polico ni uspelo.
Gradivo je že na polici.
Trajna povezava
URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto
Faktor vpliva
Izdaja
Kategorija
Razvrstitev
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Izberite knjižnično izkaznico:
Baze podatkov,
v katerih je revija indeksirana
Ime baze podatkov
Področje
Leto
Povezave do osebnih bibliografij avtorjev
Povezave do podatkov o raziskovalcih v sistemu SICRIS
