|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/4710
|
| Title: | Parallel Algorithms for Maximal Linear Forests |
| Authors: | UEHARA, Ryuhei
CHEN, Zhi-Zhong |
| Keywords: | parallel algorithms
randomized parallel algorithms
graph algorithms
linear forests
maximal matchings
maximal independent sets |
| Issue Date: | 1997-04-20 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume: | E80-A |
| Number: | 4 |
| Start page: | 627 |
| End page: | 634 |
| Abstract: | The maximal linear forest problem is to find, given a graph G = (V, E), a maximal subset of V that induces a linear forest. Three parallel algorithms for this problem are presented. The first one is randomized and runs in O(log n) expected time using n^2 processors on a CRCW PRAM. The second one is deterministic and runs in O(log^2n) timeusing n^4 processors on an EREW PRAM. The last one is deterministic and runs in O(log^5n) time using n^3 processors on an EREW PRAM. The results put the problem in the class NC. |
| Rights: | Copyright (C)1997 IEICE. Ryuhei Uehara and Zhi-Zhong Chen, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E80-A(4), 1997, 627-634. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/4710 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 3948.pdf | | 721Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
