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

Author: Gupta S.S.   Sinha B.P.  

Publisher: Academic Press

ISSN: 0743-7315

Source: Journal of Parallel and Distributed Computing, Vol.56, Iss.2, 1999-02, pp. : 144-155

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract