Efficient parallel algorithms for bipartite permutation graphs
作者:
Lin Chen,
Yaacov Yesha,
期刊:
Networks
(WILEY Available online 1993)
卷期:
Volume 23,
issue 1
页码: 29-39
ISSN:0028-3045
年代: 1993
DOI:10.1002/net.3230230105
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractIn this paper, we further study the properties of bipartite permutation graphs. We give first efficient parallel algorithms for several problems on bipartite permutation graphs. These problems include transforming a bipartite graph into a strongly ordered one if it is also a permutation graph; testing isomorphism; finding a Hamiltonian path/cycle; solving a variant of the crossing number problem; and others. All these problems can be solved inO(log2n) time withO(n3) processors on a Common CRCW PRAM. We also show that the minimum fill‐in problem for bipartite permutation graphs can be solved efficiently by a randomized parallel algorithm. ©1993 by John Wiley&Sons, I
点击下载:
PDF
(858KB)
返 回