scientific article; zbMATH DE number 19774

MaRDI QIDQ3979273zbMATH OpenFDO

Authors Peter Rajčáni

Publication date 26 June 1992

zbMATH Keywords

CRCW PRAM(Delta+1)- colouring of constant degree graphscolouring of planar graphsfinding a maximal independent set in a planar graphparallel algorithm for 3-colouring rooted trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal parallel 3-coloring algorithm for rooted trees and its applications
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

Cited in

(2)

• Optimal parallel colouring algorithms for totally decomposable graphs
• Optimal parallel 3-coloring algorithm for rooted trees and its applications

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 Q3979273)