The Library
A fast parallel algorithm for optimal edge-colouring of outerplanar graphs
Tools
Tools
Tools
Gibbons, Alan (Alan M.) and Rytter, Wojciech (1986) A fast parallel algorithm for optimal edge-colouring of outerplanar graphs. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
|
PDF
WRAP_cs-rr-080.pdf - Other - Requires a PDF viewer. Download (918Kb) | Preview |
Abstract
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM).
| Item Type: | Report | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Divisions: | Faculty of Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Parallel algorithms, Graph theory | ||||
| Series Name: | Department of Computer Science Research Report | ||||
| Publisher: | University of Warwick. Department of Computer Science | ||||
| Place of Publication: | Coventry, UK | ||||
| Official Date: | June 1986 | ||||
| Dates: |
|
||||
| Number: | Number 80 | ||||
| Number of Pages: | 14 | ||||
| DOI: | CS-RR-080 | ||||
| Institution: | University of Warwick | ||||
| Theses Department: | Department of Computer Science | ||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Unpublished | ||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
