The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—In this paper, we present a parallel recognition algorithm for bipartite-permutation graphs. The algorithm can be executed in <it>O</it>(log <it>n</it>) time on the CRCW PRAM if <it>O</it>(<it>n</it><super>3</super> /log <it>n</it>) processors are used, or <it>O</it>(log<super>2</super><it>n</it>) time on the CREW PRAM if <it>O</it>(<it>n</it><super>3</super> /log<super>2</super><it>n</it>) processors are used. Previously, Chen and Yesha have presented another CRCW PRAM algorithm that takes <it>O</it>(log<super>2</super><it>n</it>) time if <it>O</it>(<it>n</it><super>3</super>) processors are used. Compared with Chen and Yesha's algorithm, our algorithm requires either less time and fewer processors on the same machine model, or fewer processors on a weaker machine model. Besides, our algorithm can be applied to determine if two bipartite-permutation graphs are isomorphic.</p>
INDEX TERMS
Bipartite-permutation graph, graph recognition, graph isomorphism, parallel algorithm, and parallel random access machine.
CITATION

G. Chen and C. Yu, "An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 3-10, 1996.
doi:10.1109/71.481592
95 ms
(Ver 3.3 (11022016))