Search CORE

3 research outputs found

Optimally edge-colouring outerplanar graphs is in NC

Author: Gibbons Alan (Alan M.)
Rytter Wojciech
Publication venue: University of Warwick. Department of Computer Science
Publication date
Field of study

We prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)

Warwick Research Archives Portal Repository

Optimally edge-colouring outerplanar graphs is in NC

Author: Gibbons Alan
Rytter Wojciech
Publication venue: Published by Elsevier B.V.
Publication date: 10/04/1990
Field of study

AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)

Elsevier - Publisher Connector