Efficient Parallel Algorithms for Combinatorial Problems
This thesis is concerned with the design of efficient parallel algorithms for some optimization graph problems. A subset S of vertices or edges in a graph G is said to be maximum with respect to a property if, among all the subsets of G having this property, S is one having the largest cardinality. Set S is said to be maximal with respect to a property, if it is not a proper subset of another set
