| dc.contributor.author | Patwary, Mostofa Ali | eng |
| dc.date.accessioned | 2011-10-20T09:17:49Z | |
| dc.date.available | 2011-10-20T09:17:49Z | |
| dc.date.issued | 2011-08-26 | eng |
| dc.identifier.isbn | 978-82-308-1809-1 (print version) | en_US |
| dc.identifier.uri | https://hdl.handle.net/1956/5118 | |
| dc.language.iso | eng | eng |
| dc.publisher | The University of Bergen | en_US |
| dc.relation.haspart | Paper I: Md. Mostofa Ali Patwary; Jean R. S. Blair; Fredrik Manne, An Experimental Evaluation of Union-Find Algorithms for the Disjoint-Set Data Structure. | en_US |
| dc.relation.haspart | Paper II: Fredrik Manne; Md. Mostofa Ali Patwary, A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers | en_US |
| dc.relation.haspart | Paper III: Md. Mostofa Ali Patwary; Rob H. Bisseling; Fredrik Manne, Parallel Greedy Graph Matching using an Edge Partitioning Approach. | en_US |
| dc.relation.haspart | Paper IV: Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne, Parallel Algorithms for Bipartite Matching Problems on Distributed Memory Computers. | en_US |
| dc.relation.haspart | Paper V: Md. Mostofa Ali Patwary; Assefaw H. Gebremedhin; Alex Pothen, New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures. | en_US |
| dc.title | Parallel Graph Algorithms for Combinatorial Scientific Computing | en_US |
| dc.type | Doctoral thesis | |
| dc.rights.holder | Copyright the author. All rights reserved | en_US |
| dc.subject.nsi | VDP::Mathematics and natural science: 400::Information and communication science: 420 | en_US |
