A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs

Authors:
Edson Cáceres;S. W. Song;Jayme Luiz Szwarcfiter
Affiliations:
-;-;-
Venue:
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Year:
2001

Citing 5
Cited 0

Recognizing circle graphs in polynomial time

Journal of the ACM (JACM)
A bridging model for parallel computation

Communications of the ACM
Reducing prime graphs and recognizing circle graphs

Combinatorica
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a parallel algorithm for generating the maximal cliques of a circle graph with n vertices and m edges. We consider the Coarse-Grained Multicomputer Model (CGM) and show that the proposed algorithm requires O(log p) communication rounds, where p is the number of processors, independent of n. The main contribution is the use of a new technique based on the unrestricted depth search for the design of CGM algorithms.