scientific article; zbMATH DE number 4047152

From MaRDI portal
Publication:3783598





[For the entire collection see Zbl 0633.00025.] We show that every Halin and 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). Our algorithms are designed using the divide and conquer technique in a parallel setting.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783598)