Efficient serial decoding schedules for LDPC codes are described. The schedules are based on dividing the Tanner graph to sub-graphs. This yields an improvement in complexity and performance over the standard schedules. An application of the introduced schedules to decoding codes based on lifted graphs is described. An analysis based on density evolution is presented and is used to predict the behavior of different schedules.