ENUMERATING ALL CYCLES OF A PLANAR GRAPH

We present a new and elegant cycle vector space algorithm that runs in O(n 2 .α) 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...

Full description

Saved in:
Bibliographic Details
Published in:Parallel algorithms and applications Vol. 10; no. 1-2; pp. 21 - 36
Main Authors: DOG¯RUSÖZ, U., KRISHNAMOORTHY, M. S.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.08.1996
Subjects:
cycle basis
Enumerating all cycles
EREW PRAM algorithm
meshconnected SIMD computer
planar graphs
ISSN:1063-7192
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new and elegant cycle vector space algorithm that runs in O(n 2 .α) 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.
ISSN:1063-7192
DOI:10.1080/10637199608915603