Treffer: Improving the efficiency of parallel minimum spanning tree algorithms
Title:
Improving the efficiency of parallel minimum spanning tree algorithms
Authors:
Source:
Discrete Applied Mathematics. 126:33-54
Publisher Information:
Elsevier BV, 2003.
Publication Year:
2003
Subject Terms:
graph algorithms, PRAM, Parallel algorithms, Applied Mathematics, parallel algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Trees, Minimum spanning trees, connectedcomponents, 0202 electrical engineering, electronic engineering, information engineering, minimum spanning trees, Discrete Mathematics and Combinatorics, Parallel algorithms in computer science, Graph algorithms, Connected components
Document Type:
Fachzeitschrift
Article
File Description:
application/xml
Language:
English
ISSN:
0166-218X
DOI:
10.1016/s0166-218x(02)00560-7
Access URL:
https://www.sciencedirect.com/science/article/pii/S0166218X02005607
https://doi.org/10.1016/S0166-218X(02)00560-7
https://www.sciencedirect.com/science/article/abs/pii/S0166218X02005607
https://dl.acm.org/doi/10.1016/S0166-218X%2802%2900560-7
http://www.sciencedirect.com/science/article/pii/S0166218X02005607
https://dblp.uni-trier.de/db/journals/dam/dam126.html#ChongHIL03
http://hdl.handle.net/10722/88917
https://doi.org/10.1016/S0166-218X(02)00560-7
https://www.sciencedirect.com/science/article/abs/pii/S0166218X02005607
https://dl.acm.org/doi/10.1016/S0166-218X%2802%2900560-7
http://www.sciencedirect.com/science/article/pii/S0166218X02005607
https://dblp.uni-trier.de/db/journals/dam/dam126.html#ChongHIL03
http://hdl.handle.net/10722/88917
Rights:
Elsevier Non-Commercial
Accession Number:
edsair.doi.dedup.....2f2e9bf494986116bfda5bba94e8618f
Database:
OpenAIRE
Weitere Informationen
zbMATH Open Web Interface contents unavailable due to conflicting licenses.