• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
  •   Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Parallel Graph Algorithms for Combinatorial Scientific Computing

Patwary, Mostofa Ali
Doctoral thesis
Thumbnail
View/Open
Dr.thesis_Mostofa_Ali_Patwary.pdf (874.3Kb)
URI
https://hdl.handle.net/1956/5118
Date
2011-08-26
Metadata
Show full item record
Collections
  • Department of Informatics [542]
Has parts
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.

Paper II: Fredrik Manne; Md. Mostofa Ali Patwary, A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers

Paper III: Md. Mostofa Ali Patwary; Rob H. Bisseling; Fredrik Manne, Parallel Greedy Graph Matching using an Edge Partitioning Approach.

Paper IV: Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne, Parallel Algorithms for Bipartite Matching Problems on Distributed Memory Computers.

Paper V: Md. Mostofa Ali Patwary; Assefaw H. Gebremedhin; Alex Pothen, New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures.
Publisher
The University of Bergen
Copyright
Copyright the author. All rights reserved

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit