Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/8540
Поље DC-а | Вредност | Језик |
---|---|---|
dc.contributor.author | Lončar V. | en_US |
dc.contributor.author | Škrbić, S. | en_US |
dc.contributor.author | Balaž, A. | en_US |
dc.date.accessioned | 2019-09-30T09:09:26Z | - |
dc.date.available | 2019-09-30T09:09:26Z | - |
dc.date.issued | 2013-11-25 | - |
dc.identifier.isbn | 9789881925282 | en_US |
dc.identifier.issn | 20780958 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/8540 | - |
dc.description.abstract | Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim's and Kruskal's algorithm and present their parallelization targeting message passing parallel machine with distributed memory. We consider large graphs that can not fit into memory of one process. Experimental results show that Prim's algorithm is a good choice for dense graphs while Kruskal's algorithm is better for sparse ones. Poor scalability of Prim's algorithm comes from its high communication cost while Kruskal's algorithm showed much better scaling to larger number of processes. | en |
dc.relation.ispartof | Lecture Notes in Engineering and Computer Science | en |
dc.title | Distributed memory parallel algorithms for minimum spanning trees | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.scopus | 2-s2.0-84887940255 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84887940255 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 1275 | en |
dc.relation.firstpage | 1271 | en |
dc.relation.volume | 2 LNECS | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-3993-4092 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Налази се у колекцијама: | PMF Publikacije/Publications |
SCOPUSTM
Навођења
1
проверено 22.02.2020.
Преглед/и станица
25
Протекла недеља
10
10
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.