Recently, He and Yesha gave an algorithm for recognizing directed series parallel graphs, in time O(log n) with linearly many EREW processors. We give a new algorithm for this problem, based on a structural characterization of series parallel graphs in terms of their ear decompositions. Our algorithm can recognize undirected as well as directed series parallel graphs. It can be implemented in t...