Articolul precedent |
Articolul urmator |
865 18 |
Ultima descărcare din IBN: 2024-04-04 00:26 |
SM ISO690:2012 NISTIRIUC, Ana, ABABII, Victor, CHIHAI, Andrei, ŢURCANU, Dinu, BEJAN, Nicolae, ALEXEI, Anatolie, NISTIRIUC, Ion, SHARMA POPOVICI, Natalia, NISTIRIUC, Pavel. Determinarea ratei maxime de transfer a informației dintre două noduri aleatorii ale reţelei de comunicaţii. In: Telecommunications, Electronics and Informatics, Ed. 6, 24-27 mai 2018, Chișinău. Chișinău, Republica Moldova: 2018, Ed. 6, pp. 58-60. ISBN 978-9975-45-540-4. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Telecommunications, Electronics and Informatics Ed. 6, 2018 |
||||||
Conferința "Telecommunications, Electronics and Informatics" 6, Chișinău, Moldova, 24-27 mai 2018 | ||||||
|
||||||
Pag. 58-60 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
This paper analyzes how to use the FordFulkerson algorithm to determine the maximum data transmission (DT) flow between two nodes of the communication network over a certain period of time. |
||||||
Cuvinte-cheie Reţea de comunicaţii, graf, rată maximă de transfer a datelor, algoritmului lui Ford-Fulkerson |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Nistiriuc, A.</dc:creator> <dc:creator>Ababii, V.V.</dc:creator> <dc:creator>Chihai, A.</dc:creator> <dc:creator>Ţurcanu, D.</dc:creator> <dc:creator>Bejan, N.</dc:creator> <dc:creator>Alexei, A.S.</dc:creator> <dc:creator>Nistiriuc, I.</dc:creator> <dc:creator>Sharma Popovici, N.</dc:creator> <dc:creator>Nistiriuc, P.V.</dc:creator> <dc:date>2018</dc:date> <dc:description xml:lang='en'><p>This paper analyzes how to use the FordFulkerson algorithm to determine the maximum data transmission (DT) flow between two nodes of the communication network over a certain period of time.</p></dc:description> <dc:source>Telecommunications, Electronics and Informatics (Ed. 6) 58-60</dc:source> <dc:subject>Reţea de comunicaţii</dc:subject> <dc:subject>rată maximă de transfer a datelor</dc:subject> <dc:subject>algoritmului lui Ford-Fulkerson</dc:subject> <dc:subject>graf</dc:subject> <dc:title>Determinarea ratei maxime de transfer a informației dintre două noduri aleatorii ale reţelei de comunicaţii</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>