Show simple item record

dc.contributor.authorPatwary, Mostofa Alieng
dc.date.accessioned2011-10-20T09:17:49Z
dc.date.available2011-10-20T09:17:49Z
dc.date.issued2011-08-26eng
dc.identifier.isbn978-82-308-1809-1 (print version)eng
dc.identifier.urihttp://hdl.handle.net/1956/5118
dc.language.isoengeng
dc.publisherThe University of Bergeneng
dc.relation.haspartPaper I: Md. Mostofa Ali Patwary; Jean R. S. Blair; Fredrik Manne, An Experimental Evaluation of Union-Find Algorithms for the Disjoint-Set Data Structure.eng
dc.relation.haspartPaper II: Fredrik Manne; Md. Mostofa Ali Patwary, A Scalable Parallel Union-Find Algorithm for Distributed Memory Computerseng
dc.relation.haspartPaper III: Md. Mostofa Ali Patwary; Rob H. Bisseling; Fredrik Manne, Parallel Greedy Graph Matching using an Edge Partitioning Approach.eng
dc.relation.haspartPaper IV: Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne, Parallel Algorithms for Bipartite Matching Problems on Distributed Memory Computers.eng
dc.relation.haspartPaper V: Md. Mostofa Ali Patwary; Assefaw H. Gebremedhin; Alex Pothen, New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures.eng
dc.titleParallel Graph Algorithms for Combinatorial Scientific Computingeng
dc.typeDoctoral thesiseng
dc.subject.nsiVDP::Mathematics and natural science: 400::Information and communication science: 420eng
dc.rights.holderCopyright the author. All rights reserved


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record