Affiliation:
1. FRL, P. O. Box 18345, Los Angeles, CA 90018, USA
Abstract
Provably fastest parallel algorithms for a number of problems on bipartite permutation graphs are presented here. These problems include, among others, connectivity, recognition, isomorphism detection, Hamiltonian path, and shortest path. The algorithms here all run in logarithmic time on CREW PRAM. The processor bound is the same as that for multiplying two matrices in logarithmic time on the model and is subcubic.
Publisher
World Scientific Pub Co Pte Lt
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Empirical-likelihood-based difference-in-differences estimators;Journal of the Royal Statistical Society: Series B (Statistical Methodology);2008-04
2. Generalized linear models incorporating population level information: an empirical-likelihood-based approach;Journal of the Royal Statistical Society: Series B (Statistical Methodology);2008-04