Bounded Degree Maximal Subgraph Problems are in NC

7Ve show that tile probiem of finding a maximal vertex-induced jresg., edge-induced) subgraph of maximum degree il. is in NC2 for k 2 C (resp., k > 1). For these problems, we develope a method which exploits the KC algorithm for the maximal independent set problem.