Articolul precedent |
Articolul urmator |
701 8 |
Ultima descărcare din IBN: 2022-12-26 10:59 |
SM ISO690:2012 NISTIRIUC, Ana, ABABII, Victor, CHIHAI, Andrei, ŢURCANU, Dinu, BEJAN, Nicolae, ALEXEI, Anatolie, NISTIRIUC, Ion, SHARMA POPOVICI, Natalia, NISTIRIUC, Pavel. Reprezentarea eficientă a sursei de date în reţeaua 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. 61-62. 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. 61-62 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
This paper analyzes the approach of using Kruskal's algorithm to determine the minimum tree that contains the graph network communications |
|||||
Cuvinte-cheie Reţea de comunicaţii, arborele cu valoare minimă, algoritmul lui Kruskal, graf |
|||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Nistiriuc, A.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Ababii, V.V.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Chihai, A.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Ţurcanu, D.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Bejan, N.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Alexei, A.S.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Nistiriuc, I.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Sharma Popovici, N.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Nistiriuc, P.V.</creatorName> <affiliation>Universitatea Tehnică a Moldovei, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='ro'>Reprezentarea eficientă a sursei de date în reţeaua de comunicaţii</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2018</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-9975-45-540-4</relatedIdentifier> <subjects> <subject>Reţea de comunicaţii</subject> <subject>arborele cu valoare minimă</subject> <subject>algoritmul lui Kruskal</subject> <subject>graf</subject> </subjects> <dates> <date dateType='Issued'>2018</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><p>This paper analyzes the approach of using Kruskal's algorithm to determine the minimum tree that contains the graph network communications</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>