This paper presents several parallel algorithms on unweighted graphs for hypercube
computers. The algorithms are for checking bipartiteness and for finding a spanning forest,
the connected components, a fundamental cycle set, and the bridges of a graph. The
algorithm for finding spanning forest is based on a strategy of successive elimination of non-
forest edges. The input graph is partitioned equally among processors, which repeatedly
eliminate non-forest edges and merge their results to finally construct the desired forest of …