Bergen Open Research Archive

Parallel Graph Algorithms for Combinatorial Scientific Computing

Bergen Open Research Archive

Show simple item record Patwary, Mostofa Ali 2011-10-20T09:17:49Z 2011-10-20T09:17:49Z 2011-08-26
dc.identifier.isbn 978-82-308-1809-1 (print version)
dc.language.iso eng en
dc.publisher The University of Bergen en
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
dc.relation.haspart Paper II: Fredrik Manne; Md. Mostofa Ali Patwary, A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers en
dc.relation.haspart Paper III: Md. Mostofa Ali Patwary; Rob H. Bisseling; Fredrik Manne, Parallel Greedy Graph Matching using an Edge Partitioning Approach. en
dc.relation.haspart Paper IV: Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne, Parallel Algorithms for Bipartite Matching Problems on Distributed Memory Computers. en
dc.relation.haspart Paper V: Md. Mostofa Ali Patwary; Assefaw H. Gebremedhin; Alex Pothen, New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures. en
dc.rights Copyright the author. All rights reserved. en
dc.title Parallel Graph Algorithms for Combinatorial Scientific Computing en
dc.type Doctoral thesis eng
dc.subject.nsi VDP::Mathematics and natural science: 400::Information and communication science: 420 en

Files in this item


This item appears in the following Collection(s)

Show simple item record

Search BORA


My Account