Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"boolean matrix multiplication"”.
-
Efficient parallel computation on multiprocessors with optical interconnection networks
… including sorting, merging, and selection; Boolean matrix multiplication, transitive closure and their applications to connected component problems. We implement an optimal sorting algorithm on an n-processor LARPBS. With this optimal sorting algorithm at disposal, we study the sorting …
-
Complexity of Dyck-reachability in directed graphs
… problem and the conditional reduction to Boolean Matrix Multiplication as well as the k-clique problem. Finally, we give a linear-time algorithm that computes st-Dyck-reachability for graphs with bounded treewidth and using a bounded stack.