Abstract
We present a new and elegant cycle vector space algorithm that runs in O(n2.α) steps and needs O:lpar;nn) space for enumerating all simple cycles of a planar graph with n vertices, where α is the total number of simple cycles in the graph Unlike backtrack algorithms, cycle vector space algorithms for this problem are suitable for parallelization. A parallel version of this algorithm alone with a parallel version of Syslo's O(n.α) step algorithm for the same problem are on an exclusive-read, exclusive-write parallel RAM model with p processors. The results of an implementation of our parallel algorithm on a meshconnected SIMD computer are also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
