Abstract
For a graph G=(V,E) with n vertices and m edges, we present a simple parallel algorithm that finda an independent set of size /4m by using method of conditional probability.