In this paper, we propose parallel algorithms for breadth-first search and depth-first search on the hypercube network model. In addition, a parallel algorithm based on the same model for finding maximum matching in bipartite graphs is proposed.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage PlusPublished in last 50 years