Loading...
Please wait, while we are loading the content...
Similar Documents
Fast Parallel Decomposition by Clique Separators
| Content Provider | Semantic Scholar |
|---|---|
| Author | Dahlhaus, Elias Karpinski, Marek |
| Copyright Year | 1988 |
| Abstract | We design a fast parallel algorithm for decomposing an arbitrtary graph by the clique separators. The algorithm works in $O(log^2 n)$ parallel time and $O(n^4)$ processors on a CREW-PRAM. It is the first sublinear parallel time (and therefore sequential sublinear space) algorithm for this problem. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/1985-1989/8525-CS.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |