![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
In this paper, an time and
processors parallel algorithm is designed to generate all paths from leaf nodes to the root of a tree, where n' is the total number of such paths. Using this algorithm an
time and
processors parallel algorithm is designed to generate all maximal independent sets on permutation graphs, where n represents the number of vertices(nodes) N is the output size. Both the algorithms run on an EREW PRAM.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.