Affiliation:
1. Department of Mathematics University “La Sapienza” Piazzale Aldo Moro 2 00185 Rome, Italy
Abstract
In this paper three parallel recognition algorithms for threshold, matrogenic and box-threshold graphs, respectively, are given. These classes of graphs are inclusionwise comparable and depend only on their degree sequences. The algorithms run in O(log n) parallel time on a PRAM-EREW model of computation and require O(n/log n) processors when the degree sequence, ordered in decreasing fashion, is given as input.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献