A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs.

Srabani Sen Gupta Bhabani P. Sinha A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. 144-155 1999 56 J. Parallel Distrib. Comput. 2 db/journals/jpdc/jpdc56.html#GuptaS99