dc.contributor.author | NISTIRIUC, Ana | |
dc.contributor.author | ABABII, Victor | |
dc.contributor.author | CHIHAI, Andrei | |
dc.contributor.author | ŢURCANU, Dinu | |
dc.contributor.author | BEJAN, Nicolae | |
dc.contributor.author | ALEXEI, Anatol | |
dc.contributor.author | NISTIRIUC, Ion | |
dc.contributor.author | SHARMA POPOVICI, Natalia | |
dc.contributor.author | NISTIRIUC, Pavel V. | |
dc.date.accessioned | 2019-05-14T06:24:35Z | |
dc.date.available | 2019-05-14T06:24:35Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | NISTIRIUC, Ana, ABABII, Victor, CHIHAI, Andrei et al. Determinarea ratei maxime de transfer a informației dintre două noduri aleatorii ale reţelei de comunicaţii. In: Telecomunicaţii, Electronică şi Informatică: proc. of the 6th intern. conf., May 24-27, 2018. Chişinău, 2018, pp. 58-60. ISBN 978-9975-45-540-4. | en_US |
dc.identifier.isbn | 978-9975-45-540-4 | |
dc.identifier.uri | http://repository.utm.md/handle/5014/2445 | |
dc.description.abstract | This paper analyzes how to use the Ford- Fulkerson algorithm to determine the maximum data transmission (DT) flow between two nodes of the communication network over a certain period of time. | en_US |
dc.language.iso | ro | en_US |
dc.publisher | Tehnica UTM | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | communication networks | en_US |
dc.subject | Ford- Fulkerson algorithm | en_US |
dc.subject | data transfer | en_US |
dc.subject | graphs | en_US |
dc.subject | reţele de comunicaţii | en_US |
dc.subject | transfer de date | en_US |
dc.subject | algoritmul lui Ford-Fulkerson | en_US |
dc.subject | grafuri | en_US |
dc.title | Determinarea ratei maxime de transfer a informației dintre două noduri aleatorii ale reţelei de comunicaţii | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: